./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/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 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:41:34,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:41:34,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:41:34,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:41:34,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:41:34,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:41:34,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:41:34,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:41:34,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:41:34,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:41:34,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:41:34,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:41:34,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:41:34,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:41:34,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:41:34,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:41:34,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:41:34,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:41:34,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:41:34,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:41:34,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:41:34,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:41:34,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:41:34,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:41:34,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:41:34,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:41:34,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:41:34,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:41:34,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:41:34,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:41:34,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:41:34,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:41:34,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:41:34,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:41:34,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:41:34,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:41:34,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:41:34,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:41:34,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:41:34,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:41:34,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:41:34,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:41:34,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:41:34,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:41:34,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:41:34,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:41:34,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:41:34,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:41:34,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:41:34,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:41:34,765 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:41:34,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:41:34,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:41:34,767 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:41:34,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:41:34,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:41:34,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:41:34,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:41:34,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:41:34,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:41:34,768 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:41:34,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:41:34,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:41:34,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:41:34,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:41:34,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:41:34,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:41:34,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:41:34,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:41:34,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:41:34,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:41:34,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:41:34,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:41:34,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:41:34,773 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:41:34,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:41:34,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:41:34,774 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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/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 -> 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 [2022-11-02 20:41:35,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:41:35,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:41:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:41:35,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:41:35,173 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:41:35,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-02 20:41:35,270 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/data/7c7b5247f/500ce26e3a38465c92a2eb1aabfa155d/FLAG6ed80626c [2022-11-02 20:41:35,928 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:41:35,928 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-02 20:41:35,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/data/7c7b5247f/500ce26e3a38465c92a2eb1aabfa155d/FLAG6ed80626c [2022-11-02 20:41:36,263 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/data/7c7b5247f/500ce26e3a38465c92a2eb1aabfa155d [2022-11-02 20:41:36,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:41:36,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:41:36,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:41:36,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:41:36,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:41:36,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d65e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36, skipping insertion in model container [2022-11-02 20:41:36,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:41:36,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:41:36,658 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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-02 20:41:36,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:41:36,691 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:41:36,769 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_35585b7c-a7a9-4ba7-8388-ce4a9128e832/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-02 20:41:36,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:41:36,817 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:41:36,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36 WrapperNode [2022-11-02 20:41:36,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:41:36,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:41:36,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:41:36,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:41:36,830 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:41:36" (1/1) ... [2022-11-02 20:41:36,860 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:41:36" (1/1) ... [2022-11-02 20:41:36,928 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 601 [2022-11-02 20:41:36,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:41:36,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:41:36,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:41:36,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:41:36,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:36,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:37,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:41:36" (1/1) ... [2022-11-02 20:41:37,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:41:37,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:41:37,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:41:37,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:41:37,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (1/1) ... [2022-11-02 20:41:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:41:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:37,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:41:37,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:41:37,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:41:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:41:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:41:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:41:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:41:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:41:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:41:37,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:41:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:41:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:41:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:41:37,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:41:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:41:37,121 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:41:37,338 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:41:37,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:41:38,539 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:41:38,578 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:41:38,578 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:41:38,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:41:38 BoogieIcfgContainer [2022-11-02 20:41:38,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:41:38,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:41:38,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:41:38,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:41:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:41:36" (1/3) ... [2022-11-02 20:41:38,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0c6157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:41:38, skipping insertion in model container [2022-11-02 20:41:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:36" (2/3) ... [2022-11-02 20:41:38,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0c6157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:41:38, skipping insertion in model container [2022-11-02 20:41:38,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:41:38" (3/3) ... [2022-11-02 20:41:38,612 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2022-11-02 20:41:38,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:41:38,648 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:41:38,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-11-02 20:41:38,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:41:38,927 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:41:39,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 751 places, 787 transitions, 1590 flow [2022-11-02 20:41:39,544 INFO L130 PetriNetUnfolder]: 43/785 cut-off events. [2022-11-02 20:41:39,544 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:41:39,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 785 events. 43/785 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2089 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 567. Up to 2 conditions per place. [2022-11-02 20:41:39,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 751 places, 787 transitions, 1590 flow [2022-11-02 20:41:39,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 723 places, 756 transitions, 1524 flow [2022-11-02 20:41:39,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:41:39,617 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;@13c777cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:41:39,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2022-11-02 20:41:39,624 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 20:41:39,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:41:39,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:39,625 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] [2022-11-02 20:41:39,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2146948276, now seen corresponding path program 1 times [2022-11-02 20:41:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:39,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774738693] [2022-11-02 20:41:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:39,964 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:41:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774738693] [2022-11-02 20:41:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774738693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:39,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:39,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266132815] [2022-11-02 20:41:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:39,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:40,045 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 787 [2022-11-02 20:41:40,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 756 transitions, 1524 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:40,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:40,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 787 [2022-11-02 20:41:40,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:42,846 INFO L130 PetriNetUnfolder]: 617/7320 cut-off events. [2022-11-02 20:41:42,847 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-11-02 20:41:42,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 7320 events. 617/7320 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 62401 event pairs, 255 based on Foata normal form. 172/5840 useless extension candidates. Maximal degree in co-relation 7420. Up to 604 conditions per place. [2022-11-02 20:41:43,023 INFO L137 encePairwiseOnDemand]: 771/787 looper letters, 37 selfloop transitions, 2 changer transitions 2/742 dead transitions. [2022-11-02 20:41:43,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 742 transitions, 1574 flow [2022-11-02 20:41:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2022-11-02 20:41:43,064 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.952562473528166 [2022-11-02 20:41:43,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2249 transitions. [2022-11-02 20:41:43,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2249 transitions. [2022-11-02 20:41:43,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:43,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2249 transitions. [2022-11-02 20:41:43,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:43,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:43,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:43,113 INFO L175 Difference]: Start difference. First operand has 723 places, 756 transitions, 1524 flow. Second operand 3 states and 2249 transitions. [2022-11-02 20:41:43,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 742 transitions, 1574 flow [2022-11-02 20:41:43,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 742 transitions, 1566 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:41:43,153 INFO L231 Difference]: Finished difference. Result has 720 places, 740 transitions, 1488 flow [2022-11-02 20:41:43,157 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=720, PETRI_TRANSITIONS=740} [2022-11-02 20:41:43,166 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -3 predicate places. [2022-11-02 20:41:43,166 INFO L495 AbstractCegarLoop]: Abstraction has has 720 places, 740 transitions, 1488 flow [2022-11-02 20:41:43,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:43,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:43,169 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] [2022-11-02 20:41:43,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:41:43,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1169092274, now seen corresponding path program 1 times [2022-11-02 20:41:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:43,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663579737] [2022-11-02 20:41:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,277 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:41:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:43,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663579737] [2022-11-02 20:41:43,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663579737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:43,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:43,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097147497] [2022-11-02 20:41:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:43,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:43,287 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 787 [2022-11-02 20:41:43,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 740 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:43,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:43,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 787 [2022-11-02 20:41:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:45,517 INFO L130 PetriNetUnfolder]: 618/7348 cut-off events. [2022-11-02 20:41:45,518 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-02 20:41:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7974 conditions, 7348 events. 618/7348 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 63225 event pairs, 255 based on Foata normal form. 0/5689 useless extension candidates. Maximal degree in co-relation 7935. Up to 603 conditions per place. [2022-11-02 20:41:45,705 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 37 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2022-11-02 20:41:45,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 739 transitions, 1564 flow [2022-11-02 20:41:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-02 20:41:45,716 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9470563320626854 [2022-11-02 20:41:45,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-02 20:41:45,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-02 20:41:45,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:45,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-02 20:41:45,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:45,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:45,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:45,736 INFO L175 Difference]: Start difference. First operand has 720 places, 740 transitions, 1488 flow. Second operand 3 states and 2236 transitions. [2022-11-02 20:41:45,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 739 transitions, 1564 flow [2022-11-02 20:41:45,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 739 transitions, 1560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:45,753 INFO L231 Difference]: Finished difference. Result has 717 places, 739 transitions, 1486 flow [2022-11-02 20:41:45,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=717, PETRI_TRANSITIONS=739} [2022-11-02 20:41:45,756 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -6 predicate places. [2022-11-02 20:41:45,756 INFO L495 AbstractCegarLoop]: Abstraction has has 717 places, 739 transitions, 1486 flow [2022-11-02 20:41:45,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:45,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:45,759 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] [2022-11-02 20:41:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:41:45,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 955563429, now seen corresponding path program 1 times [2022-11-02 20:41:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:45,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775892246] [2022-11-02 20:41:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,892 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:41:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:45,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775892246] [2022-11-02 20:41:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775892246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:45,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:45,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608381137] [2022-11-02 20:41:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:45,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 787 [2022-11-02 20:41:45,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 739 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:45,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:45,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 787 [2022-11-02 20:41:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:46,470 INFO L130 PetriNetUnfolder]: 87/1567 cut-off events. [2022-11-02 20:41:46,471 INFO L131 PetriNetUnfolder]: For 2/17 co-relation queries the response was YES. [2022-11-02 20:41:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1567 events. 87/1567 cut-off events. For 2/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8287 event pairs, 24 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 1640. Up to 87 conditions per place. [2022-11-02 20:41:46,502 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 37 selfloop transitions, 2 changer transitions 0/738 dead transitions. [2022-11-02 20:41:46,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 738 transitions, 1562 flow [2022-11-02 20:41:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-02 20:41:46,509 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9470563320626854 [2022-11-02 20:41:46,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-02 20:41:46,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-02 20:41:46,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:46,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-02 20:41:46,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:46,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:46,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:46,530 INFO L175 Difference]: Start difference. First operand has 717 places, 739 transitions, 1486 flow. Second operand 3 states and 2236 transitions. [2022-11-02 20:41:46,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 738 transitions, 1562 flow [2022-11-02 20:41:46,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 738 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:46,554 INFO L231 Difference]: Finished difference. Result has 716 places, 738 transitions, 1484 flow [2022-11-02 20:41:46,556 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=716, PETRI_TRANSITIONS=738} [2022-11-02 20:41:46,559 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -7 predicate places. [2022-11-02 20:41:46,559 INFO L495 AbstractCegarLoop]: Abstraction has has 716 places, 738 transitions, 1484 flow [2022-11-02 20:41:46,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:46,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:46,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:46,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:41:46,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1436056422, now seen corresponding path program 1 times [2022-11-02 20:41:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:46,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489080580] [2022-11-02 20:41:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,686 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:41:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489080580] [2022-11-02 20:41:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489080580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:46,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:46,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390677388] [2022-11-02 20:41:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:46,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:46,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:46,697 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 787 [2022-11-02 20:41:46,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 738 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:46,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:46,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 787 [2022-11-02 20:41:46,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:47,169 INFO L130 PetriNetUnfolder]: 57/1022 cut-off events. [2022-11-02 20:41:47,170 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:41:47,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 1022 events. 57/1022 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4107 event pairs, 18 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1057. Up to 62 conditions per place. [2022-11-02 20:41:47,207 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 25 selfloop transitions, 2 changer transitions 0/737 dead transitions. [2022-11-02 20:41:47,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 737 transitions, 1536 flow [2022-11-02 20:41:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2260 transitions. [2022-11-02 20:41:47,215 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9572215163066498 [2022-11-02 20:41:47,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2260 transitions. [2022-11-02 20:41:47,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2260 transitions. [2022-11-02 20:41:47,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:47,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2260 transitions. [2022-11-02 20:41:47,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states 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:41:47,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:47,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:47,237 INFO L175 Difference]: Start difference. First operand has 716 places, 738 transitions, 1484 flow. Second operand 3 states and 2260 transitions. [2022-11-02 20:41:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 737 transitions, 1536 flow [2022-11-02 20:41:47,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:47,258 INFO L231 Difference]: Finished difference. Result has 715 places, 737 transitions, 1482 flow [2022-11-02 20:41:47,260 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=715, PETRI_TRANSITIONS=737} [2022-11-02 20:41:47,261 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -8 predicate places. [2022-11-02 20:41:47,261 INFO L495 AbstractCegarLoop]: Abstraction has has 715 places, 737 transitions, 1482 flow [2022-11-02 20:41:47,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:47,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:47,264 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:41:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:41:47,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1317896122, now seen corresponding path program 1 times [2022-11-02 20:41:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135385621] [2022-11-02 20:41:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,326 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:41:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135385621] [2022-11-02 20:41:47,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135385621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:47,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:47,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634264423] [2022-11-02 20:41:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:47,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:47,334 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 787 [2022-11-02 20:41:47,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 737 transitions, 1482 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states 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:41:47,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:47,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 787 [2022-11-02 20:41:47,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:47,856 INFO L130 PetriNetUnfolder]: 65/1248 cut-off events. [2022-11-02 20:41:47,856 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-11-02 20:41:47,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1248 events. 65/1248 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4944 event pairs, 15 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1266. Up to 55 conditions per place. [2022-11-02 20:41:47,889 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 22 selfloop transitions, 2 changer transitions 0/736 dead transitions. [2022-11-02 20:41:47,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 736 transitions, 1528 flow [2022-11-02 20:41:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2022-11-02 20:41:47,895 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9597628123676408 [2022-11-02 20:41:47,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2266 transitions. [2022-11-02 20:41:47,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2266 transitions. [2022-11-02 20:41:47,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:47,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2266 transitions. [2022-11-02 20:41:47,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states 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:41:47,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:47,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:47,914 INFO L175 Difference]: Start difference. First operand has 715 places, 737 transitions, 1482 flow. Second operand 3 states and 2266 transitions. [2022-11-02 20:41:47,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 736 transitions, 1528 flow [2022-11-02 20:41:47,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 736 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:47,930 INFO L231 Difference]: Finished difference. Result has 714 places, 736 transitions, 1480 flow [2022-11-02 20:41:47,932 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=714, PETRI_TRANSITIONS=736} [2022-11-02 20:41:47,933 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -9 predicate places. [2022-11-02 20:41:47,933 INFO L495 AbstractCegarLoop]: Abstraction has has 714 places, 736 transitions, 1480 flow [2022-11-02 20:41:47,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states 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:41:47,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:47,935 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] [2022-11-02 20:41:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:41:47,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -362587783, now seen corresponding path program 1 times [2022-11-02 20:41:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855278853] [2022-11-02 20:41:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,026 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:41:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:48,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855278853] [2022-11-02 20:41:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855278853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:48,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:48,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305958213] [2022-11-02 20:41:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:48,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:48,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:48,033 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 787 [2022-11-02 20:41:48,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 736 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states 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:41:48,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:48,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 787 [2022-11-02 20:41:48,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:48,452 INFO L130 PetriNetUnfolder]: 87/1310 cut-off events. [2022-11-02 20:41:48,452 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:41:48,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 1310 events. 87/1310 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6403 event pairs, 36 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1403. Up to 116 conditions per place. [2022-11-02 20:41:48,489 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 43 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2022-11-02 20:41:48,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 735 transitions, 1568 flow [2022-11-02 20:41:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2224 transitions. [2022-11-02 20:41:48,496 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9419737399407031 [2022-11-02 20:41:48,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2224 transitions. [2022-11-02 20:41:48,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2224 transitions. [2022-11-02 20:41:48,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:48,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2224 transitions. [2022-11-02 20:41:48,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.3333333333334) internal successors, (2224), 3 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states 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:41:48,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:48,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:48,511 INFO L175 Difference]: Start difference. First operand has 714 places, 736 transitions, 1480 flow. Second operand 3 states and 2224 transitions. [2022-11-02 20:41:48,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 735 transitions, 1568 flow [2022-11-02 20:41:48,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 735 transitions, 1564 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:48,528 INFO L231 Difference]: Finished difference. Result has 713 places, 735 transitions, 1478 flow [2022-11-02 20:41:48,529 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=713, PETRI_TRANSITIONS=735} [2022-11-02 20:41:48,530 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -10 predicate places. [2022-11-02 20:41:48,530 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 735 transitions, 1478 flow [2022-11-02 20:41:48,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states 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:41:48,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:48,532 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] [2022-11-02 20:41:48,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:41:48,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:48,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:48,533 INFO L85 PathProgramCache]: Analyzing trace with hash 811644936, now seen corresponding path program 1 times [2022-11-02 20:41:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:48,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257139573] [2022-11-02 20:41:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,583 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:41:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257139573] [2022-11-02 20:41:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257139573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:48,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:48,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171180440] [2022-11-02 20:41:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:48,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:48,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:48,591 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 787 [2022-11-02 20:41:48,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 735 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:48,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:48,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 787 [2022-11-02 20:41:48,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:49,009 INFO L130 PetriNetUnfolder]: 63/1007 cut-off events. [2022-11-02 20:41:49,010 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-11-02 20:41:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1007 events. 63/1007 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4987 event pairs, 24 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1027. Up to 86 conditions per place. [2022-11-02 20:41:49,043 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 36 selfloop transitions, 2 changer transitions 0/734 dead transitions. [2022-11-02 20:41:49,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 734 transitions, 1552 flow [2022-11-02 20:41:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2022-11-02 20:41:49,051 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9466327827191868 [2022-11-02 20:41:49,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2235 transitions. [2022-11-02 20:41:49,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2235 transitions. [2022-11-02 20:41:49,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:49,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2235 transitions. [2022-11-02 20:41:49,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states 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:41:49,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:49,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:49,069 INFO L175 Difference]: Start difference. First operand has 713 places, 735 transitions, 1478 flow. Second operand 3 states and 2235 transitions. [2022-11-02 20:41:49,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 734 transitions, 1552 flow [2022-11-02 20:41:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 734 transitions, 1548 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:49,089 INFO L231 Difference]: Finished difference. Result has 712 places, 734 transitions, 1476 flow [2022-11-02 20:41:49,091 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=712, PETRI_TRANSITIONS=734} [2022-11-02 20:41:49,092 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -11 predicate places. [2022-11-02 20:41:49,092 INFO L495 AbstractCegarLoop]: Abstraction has has 712 places, 734 transitions, 1476 flow [2022-11-02 20:41:49,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:41:49,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:49,094 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] [2022-11-02 20:41:49,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:41:49,095 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1135134450, now seen corresponding path program 1 times [2022-11-02 20:41:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661525877] [2022-11-02 20:41:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661525877] [2022-11-02 20:41:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661525877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:49,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228255465] [2022-11-02 20:41:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:49,213 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 787 [2022-11-02 20:41:49,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:49,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:49,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 787 [2022-11-02 20:41:49,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:49,625 INFO L130 PetriNetUnfolder]: 57/1018 cut-off events. [2022-11-02 20:41:49,625 INFO L131 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2022-11-02 20:41:49,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 1018 events. 57/1018 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4704 event pairs, 18 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1007. Up to 62 conditions per place. [2022-11-02 20:41:49,658 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 25 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2022-11-02 20:41:49,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 733 transitions, 1528 flow [2022-11-02 20:41:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2260 transitions. [2022-11-02 20:41:49,667 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9572215163066498 [2022-11-02 20:41:49,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2260 transitions. [2022-11-02 20:41:49,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2260 transitions. [2022-11-02 20:41:49,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:49,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2260 transitions. [2022-11-02 20:41:49,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states 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:41:49,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:49,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:49,685 INFO L175 Difference]: Start difference. First operand has 712 places, 734 transitions, 1476 flow. Second operand 3 states and 2260 transitions. [2022-11-02 20:41:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 733 transitions, 1528 flow [2022-11-02 20:41:49,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 733 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:49,705 INFO L231 Difference]: Finished difference. Result has 711 places, 733 transitions, 1474 flow [2022-11-02 20:41:49,706 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=711, PETRI_TRANSITIONS=733} [2022-11-02 20:41:49,707 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -12 predicate places. [2022-11-02 20:41:49,707 INFO L495 AbstractCegarLoop]: Abstraction has has 711 places, 733 transitions, 1474 flow [2022-11-02 20:41:49,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:49,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:49,709 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] [2022-11-02 20:41:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:41:49,710 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2064845023, now seen corresponding path program 1 times [2022-11-02 20:41:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:49,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581467239] [2022-11-02 20:41:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581467239] [2022-11-02 20:41:49,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581467239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:49,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916650764] [2022-11-02 20:41:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:49,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:49,768 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 787 [2022-11-02 20:41:49,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states 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:41:49,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:49,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 787 [2022-11-02 20:41:49,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:50,105 INFO L130 PetriNetUnfolder]: 53/974 cut-off events. [2022-11-02 20:41:50,105 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-11-02 20:41:50,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 974 events. 53/974 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3846 event pairs, 15 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 949. Up to 55 conditions per place. [2022-11-02 20:41:50,129 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 22 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2022-11-02 20:41:50,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 732 transitions, 1520 flow [2022-11-02 20:41:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2022-11-02 20:41:50,136 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9597628123676408 [2022-11-02 20:41:50,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2266 transitions. [2022-11-02 20:41:50,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2266 transitions. [2022-11-02 20:41:50,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:50,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2266 transitions. [2022-11-02 20:41:50,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states 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:41:50,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:50,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:50,151 INFO L175 Difference]: Start difference. First operand has 711 places, 733 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2022-11-02 20:41:50,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 732 transitions, 1520 flow [2022-11-02 20:41:50,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 732 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:50,165 INFO L231 Difference]: Finished difference. Result has 710 places, 732 transitions, 1472 flow [2022-11-02 20:41:50,167 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=710, PETRI_TRANSITIONS=732} [2022-11-02 20:41:50,167 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -13 predicate places. [2022-11-02 20:41:50,168 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 732 transitions, 1472 flow [2022-11-02 20:41:50,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states 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:41:50,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:50,169 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] [2022-11-02 20:41:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:41:50,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1090270051, now seen corresponding path program 1 times [2022-11-02 20:41:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:50,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845518780] [2022-11-02 20:41:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,219 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:41:50,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:50,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845518780] [2022-11-02 20:41:50,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845518780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:50,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:50,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601530874] [2022-11-02 20:41:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:50,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:50,225 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 787 [2022-11-02 20:41:50,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states 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:41:50,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:50,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 787 [2022-11-02 20:41:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:50,595 INFO L130 PetriNetUnfolder]: 75/1028 cut-off events. [2022-11-02 20:41:50,596 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-11-02 20:41:50,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1028 events. 75/1028 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5526 event pairs, 36 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 1057. Up to 116 conditions per place. [2022-11-02 20:41:50,627 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 43 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2022-11-02 20:41:50,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 731 transitions, 1560 flow [2022-11-02 20:41:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2224 transitions. [2022-11-02 20:41:50,633 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9419737399407031 [2022-11-02 20:41:50,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2224 transitions. [2022-11-02 20:41:50,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2224 transitions. [2022-11-02 20:41:50,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:50,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2224 transitions. [2022-11-02 20:41:50,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.3333333333334) internal successors, (2224), 3 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states 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:41:50,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:50,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:50,647 INFO L175 Difference]: Start difference. First operand has 710 places, 732 transitions, 1472 flow. Second operand 3 states and 2224 transitions. [2022-11-02 20:41:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 731 transitions, 1560 flow [2022-11-02 20:41:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 731 transitions, 1556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:50,662 INFO L231 Difference]: Finished difference. Result has 709 places, 731 transitions, 1470 flow [2022-11-02 20:41:50,663 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=709, PETRI_TRANSITIONS=731} [2022-11-02 20:41:50,664 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -14 predicate places. [2022-11-02 20:41:50,665 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 731 transitions, 1470 flow [2022-11-02 20:41:50,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states 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:41:50,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:50,666 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] [2022-11-02 20:41:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:41:50,667 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -696940060, now seen corresponding path program 1 times [2022-11-02 20:41:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:50,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125087669] [2022-11-02 20:41:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,796 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:41:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125087669] [2022-11-02 20:41:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125087669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902230043] [2022-11-02 20:41:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:50,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:50,802 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 787 [2022-11-02 20:41:50,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states 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:41:50,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:50,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 787 [2022-11-02 20:41:50,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:51,438 INFO L130 PetriNetUnfolder]: 111/2117 cut-off events. [2022-11-02 20:41:51,439 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-02 20:41:51,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 2117 events. 111/2117 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11146 event pairs, 15 based on Foata normal form. 0/1683 useless extension candidates. Maximal degree in co-relation 2082. Up to 56 conditions per place. [2022-11-02 20:41:51,494 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 13 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2022-11-02 20:41:51,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 730 transitions, 1498 flow [2022-11-02 20:41:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2284 transitions. [2022-11-02 20:41:51,500 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9673867005506142 [2022-11-02 20:41:51,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2284 transitions. [2022-11-02 20:41:51,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2284 transitions. [2022-11-02 20:41:51,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:51,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2284 transitions. [2022-11-02 20:41:51,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states 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:41:51,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:51,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:51,515 INFO L175 Difference]: Start difference. First operand has 709 places, 731 transitions, 1470 flow. Second operand 3 states and 2284 transitions. [2022-11-02 20:41:51,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 730 transitions, 1498 flow [2022-11-02 20:41:51,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 730 transitions, 1494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:51,530 INFO L231 Difference]: Finished difference. Result has 708 places, 730 transitions, 1468 flow [2022-11-02 20:41:51,531 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=708, PETRI_TRANSITIONS=730} [2022-11-02 20:41:51,532 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -15 predicate places. [2022-11-02 20:41:51,532 INFO L495 AbstractCegarLoop]: Abstraction has has 708 places, 730 transitions, 1468 flow [2022-11-02 20:41:51,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states 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:41:51,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:51,534 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] [2022-11-02 20:41:51,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:41:51,534 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1505192264, now seen corresponding path program 1 times [2022-11-02 20:41:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:51,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955220211] [2022-11-02 20:41:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:52,168 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:41:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955220211] [2022-11-02 20:41:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955220211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:52,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:52,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843732723] [2022-11-02 20:41:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:52,175 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:41:52,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 730 transitions, 1468 flow. Second operand has 6 states, 6 states have (on average 728.8333333333334) internal successors, (4373), 6 states have internal predecessors, (4373), 0 states have call successors, (0), 0 states 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:41:52,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:52,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:41:52,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:56,359 INFO L130 PetriNetUnfolder]: 1287/14949 cut-off events. [2022-11-02 20:41:56,360 INFO L131 PetriNetUnfolder]: For 14/32 co-relation queries the response was YES. [2022-11-02 20:41:56,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16077 conditions, 14949 events. 1287/14949 cut-off events. For 14/32 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 169275 event pairs, 588 based on Foata normal form. 0/11698 useless extension candidates. Maximal degree in co-relation 15915. Up to 1111 conditions per place. [2022-11-02 20:41:56,647 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 39 selfloop transitions, 5 changer transitions 0/729 dead transitions. [2022-11-02 20:41:56,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 729 transitions, 1554 flow [2022-11-02 20:41:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:41:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4407 transitions. [2022-11-02 20:41:56,657 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9332909783989835 [2022-11-02 20:41:56,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4407 transitions. [2022-11-02 20:41:56,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4407 transitions. [2022-11-02 20:41:56,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:56,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4407 transitions. [2022-11-02 20:41:56,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states 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:41:56,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:41:56,683 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:41:56,683 INFO L175 Difference]: Start difference. First operand has 708 places, 730 transitions, 1468 flow. Second operand 6 states and 4407 transitions. [2022-11-02 20:41:56,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 729 transitions, 1554 flow [2022-11-02 20:41:56,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 729 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:56,697 INFO L231 Difference]: Finished difference. Result has 710 places, 729 transitions, 1472 flow [2022-11-02 20:41:56,698 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=710, PETRI_TRANSITIONS=729} [2022-11-02 20:41:56,700 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -13 predicate places. [2022-11-02 20:41:56,701 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 729 transitions, 1472 flow [2022-11-02 20:41:56,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 728.8333333333334) internal successors, (4373), 6 states have internal predecessors, (4373), 0 states have call successors, (0), 0 states 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:41:56,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:56,703 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] [2022-11-02 20:41:56,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:41:56,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash -288528787, now seen corresponding path program 1 times [2022-11-02 20:41:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:56,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536280712] [2022-11-02 20:41:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:56,986 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:41:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:56,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536280712] [2022-11-02 20:41:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536280712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518556345] [2022-11-02 20:41:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:56,996 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 787 [2022-11-02 20:41:56,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 729 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states 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:41:56,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:56,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 787 [2022-11-02 20:41:56,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:57,359 INFO L130 PetriNetUnfolder]: 70/1292 cut-off events. [2022-11-02 20:41:57,359 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:41:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1292 events. 70/1292 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6208 event pairs, 2 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1366. Up to 58 conditions per place. [2022-11-02 20:41:57,391 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 24 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2022-11-02 20:41:57,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 729 transitions, 1525 flow [2022-11-02 20:41:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2022-11-02 20:41:57,397 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9580686149936467 [2022-11-02 20:41:57,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2262 transitions. [2022-11-02 20:41:57,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2262 transitions. [2022-11-02 20:41:57,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:57,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2262 transitions. [2022-11-02 20:41:57,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:57,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:57,416 INFO L175 Difference]: Start difference. First operand has 710 places, 729 transitions, 1472 flow. Second operand 3 states and 2262 transitions. [2022-11-02 20:41:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 729 transitions, 1525 flow [2022-11-02 20:41:57,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 729 transitions, 1515 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:41:57,434 INFO L231 Difference]: Finished difference. Result has 706 places, 728 transitions, 1464 flow [2022-11-02 20:41:57,435 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=706, PETRI_TRANSITIONS=728} [2022-11-02 20:41:57,437 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -17 predicate places. [2022-11-02 20:41:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 706 places, 728 transitions, 1464 flow [2022-11-02 20:41:57,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states 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:41:57,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:57,438 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] [2022-11-02 20:41:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:41:57,439 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1999334063, now seen corresponding path program 1 times [2022-11-02 20:41:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:57,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861966266] [2022-11-02 20:41:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:57,504 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:41:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:57,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861966266] [2022-11-02 20:41:57,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861966266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:57,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:57,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773326481] [2022-11-02 20:41:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:57,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:57,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:57,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:57,509 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:41:57,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states 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:41:57,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:57,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:41:57,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:57,916 INFO L130 PetriNetUnfolder]: 88/1303 cut-off events. [2022-11-02 20:41:57,917 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:41:57,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1303 events. 88/1303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6396 event pairs, 35 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 1305. Up to 112 conditions per place. [2022-11-02 20:41:57,954 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 42 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2022-11-02 20:41:57,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 728 transitions, 1553 flow [2022-11-02 20:41:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2226 transitions. [2022-11-02 20:41:57,961 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9428208386277002 [2022-11-02 20:41:57,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2226 transitions. [2022-11-02 20:41:57,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2226 transitions. [2022-11-02 20:41:57,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:57,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2226 transitions. [2022-11-02 20:41:57,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states 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:41:57,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:57,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:57,975 INFO L175 Difference]: Start difference. First operand has 706 places, 728 transitions, 1464 flow. Second operand 3 states and 2226 transitions. [2022-11-02 20:41:57,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 728 transitions, 1553 flow [2022-11-02 20:41:57,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 728 transitions, 1549 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:57,994 INFO L231 Difference]: Finished difference. Result has 705 places, 727 transitions, 1462 flow [2022-11-02 20:41:57,996 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=705, PETRI_TRANSITIONS=727} [2022-11-02 20:41:57,997 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -18 predicate places. [2022-11-02 20:41:57,997 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 727 transitions, 1462 flow [2022-11-02 20:41:57,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.0) internal successors, (2187), 3 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states 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:41:57,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:57,999 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] [2022-11-02 20:41:57,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:41:57,999 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1831247718, now seen corresponding path program 1 times [2022-11-02 20:41:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:58,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66363066] [2022-11-02 20:41:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:58,077 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:41:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:58,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66363066] [2022-11-02 20:41:58,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66363066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:58,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:58,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947424824] [2022-11-02 20:41:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:58,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:58,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:58,084 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 787 [2022-11-02 20:41:58,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:58,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:58,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 787 [2022-11-02 20:41:58,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:58,393 INFO L130 PetriNetUnfolder]: 58/1012 cut-off events. [2022-11-02 20:41:58,393 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-11-02 20:41:58,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 1012 events. 58/1012 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4674 event pairs, 17 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 918. Up to 58 conditions per place. [2022-11-02 20:41:58,422 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 24 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2022-11-02 20:41:58,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 727 transitions, 1515 flow [2022-11-02 20:41:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2022-11-02 20:41:58,429 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9580686149936467 [2022-11-02 20:41:58,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2262 transitions. [2022-11-02 20:41:58,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2262 transitions. [2022-11-02 20:41:58,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:58,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2262 transitions. [2022-11-02 20:41:58,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:58,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:58,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:58,442 INFO L175 Difference]: Start difference. First operand has 705 places, 727 transitions, 1462 flow. Second operand 3 states and 2262 transitions. [2022-11-02 20:41:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 727 transitions, 1515 flow [2022-11-02 20:41:58,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 727 transitions, 1511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:58,459 INFO L231 Difference]: Finished difference. Result has 704 places, 726 transitions, 1460 flow [2022-11-02 20:41:58,460 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=704, PETRI_TRANSITIONS=726} [2022-11-02 20:41:58,461 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -19 predicate places. [2022-11-02 20:41:58,461 INFO L495 AbstractCegarLoop]: Abstraction has has 704 places, 726 transitions, 1460 flow [2022-11-02 20:41:58,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:58,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:58,463 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] [2022-11-02 20:41:58,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:41:58,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -443611598, now seen corresponding path program 1 times [2022-11-02 20:41:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:58,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545140117] [2022-11-02 20:41:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:58,532 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:41:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:58,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545140117] [2022-11-02 20:41:58,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545140117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:58,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:58,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:58,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87956694] [2022-11-02 20:41:58,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:58,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:58,545 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 787 [2022-11-02 20:41:58,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:41:58,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:41:58,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 787 [2022-11-02 20:41:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:41:59,834 INFO L130 PetriNetUnfolder]: 384/5322 cut-off events. [2022-11-02 20:41:59,834 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-02 20:41:59,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 5322 events. 384/5322 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 41333 event pairs, 100 based on Foata normal form. 0/4246 useless extension candidates. Maximal degree in co-relation 5180. Up to 296 conditions per place. [2022-11-02 20:41:59,893 INFO L137 encePairwiseOnDemand]: 775/787 looper letters, 27 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2022-11-02 20:41:59,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 719 transitions, 1505 flow [2022-11-02 20:41:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:41:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2022-11-02 20:41:59,900 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9504447268106735 [2022-11-02 20:41:59,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2244 transitions. [2022-11-02 20:41:59,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2244 transitions. [2022-11-02 20:41:59,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:41:59,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2244 transitions. [2022-11-02 20:41:59,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states 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:41:59,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:59,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:41:59,914 INFO L175 Difference]: Start difference. First operand has 704 places, 726 transitions, 1460 flow. Second operand 3 states and 2244 transitions. [2022-11-02 20:41:59,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 719 transitions, 1505 flow [2022-11-02 20:41:59,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 719 transitions, 1501 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:41:59,929 INFO L231 Difference]: Finished difference. Result has 695 places, 718 transitions, 1450 flow [2022-11-02 20:41:59,930 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=695, PETRI_TRANSITIONS=718} [2022-11-02 20:41:59,931 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -28 predicate places. [2022-11-02 20:41:59,931 INFO L495 AbstractCegarLoop]: Abstraction has has 695 places, 718 transitions, 1450 flow [2022-11-02 20:41:59,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:41:59,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:41:59,932 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] [2022-11-02 20:41:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:41:59,933 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:41:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2026997347, now seen corresponding path program 1 times [2022-11-02 20:41:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:59,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570907563] [2022-11-02 20:41:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:00,093 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:42:00,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:00,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570907563] [2022-11-02 20:42:00,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570907563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:00,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:00,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:42:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341014802] [2022-11-02 20:42:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:42:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:00,100 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 787 [2022-11-02 20:42:00,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 718 transitions, 1450 flow. Second operand has 5 states, 5 states have (on average 752.0) internal successors, (3760), 5 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states 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:42:00,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:00,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 787 [2022-11-02 20:42:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:00,419 INFO L130 PetriNetUnfolder]: 40/979 cut-off events. [2022-11-02 20:42:00,419 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-02 20:42:00,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 979 events. 40/979 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3594 event pairs, 0 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 790. Up to 19 conditions per place. [2022-11-02 20:42:00,448 INFO L137 encePairwiseOnDemand]: 782/787 looper letters, 26 selfloop transitions, 4 changer transitions 0/727 dead transitions. [2022-11-02 20:42:00,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 727 transitions, 1528 flow [2022-11-02 20:42:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:42:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3781 transitions. [2022-11-02 20:42:00,458 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9608640406607369 [2022-11-02 20:42:00,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3781 transitions. [2022-11-02 20:42:00,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3781 transitions. [2022-11-02 20:42:00,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:00,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3781 transitions. [2022-11-02 20:42:00,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 756.2) internal successors, (3781), 5 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states 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:42:00,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:42:00,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:42:00,477 INFO L175 Difference]: Start difference. First operand has 695 places, 718 transitions, 1450 flow. Second operand 5 states and 3781 transitions. [2022-11-02 20:42:00,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 727 transitions, 1528 flow [2022-11-02 20:42:00,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 727 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:42:00,492 INFO L231 Difference]: Finished difference. Result has 700 places, 719 transitions, 1466 flow [2022-11-02 20:42:00,494 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1466, PETRI_PLACES=700, PETRI_TRANSITIONS=719} [2022-11-02 20:42:00,496 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -23 predicate places. [2022-11-02 20:42:00,496 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 719 transitions, 1466 flow [2022-11-02 20:42:00,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 752.0) internal successors, (3760), 5 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states 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:42:00,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:00,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:00,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:42:00,499 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1623496899, now seen corresponding path program 1 times [2022-11-02 20:42:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:00,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268741271] [2022-11-02 20:42:00,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268741271] [2022-11-02 20:42:00,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268741271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670808034] [2022-11-02 20:42:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:00,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:00,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:00,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:42:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:42:00,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:01,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:01,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670808034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:01,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:42:01,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-02 20:42:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139294048] [2022-11-02 20:42:01,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:01,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:42:01,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:42:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:42:01,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 787 [2022-11-02 20:42:01,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 719 transitions, 1466 flow. Second operand has 14 states, 14 states have (on average 752.5714285714286) internal successors, (10536), 14 states have internal predecessors, (10536), 0 states have call successors, (0), 0 states 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:42:01,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:01,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 787 [2022-11-02 20:42:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:02,171 INFO L130 PetriNetUnfolder]: 40/995 cut-off events. [2022-11-02 20:42:02,171 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-11-02 20:42:02,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 995 events. 40/995 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3586 event pairs, 0 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 903. Up to 11 conditions per place. [2022-11-02 20:42:02,203 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 32 selfloop transitions, 11 changer transitions 0/739 dead transitions. [2022-11-02 20:42:02,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 739 transitions, 1594 flow [2022-11-02 20:42:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:42:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:42:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8284 transitions. [2022-11-02 20:42:02,226 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.956913480420469 [2022-11-02 20:42:02,226 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8284 transitions. [2022-11-02 20:42:02,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8284 transitions. [2022-11-02 20:42:02,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:02,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8284 transitions. [2022-11-02 20:42:02,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 753.0909090909091) internal successors, (8284), 11 states have internal predecessors, (8284), 0 states have call successors, (0), 0 states 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:42:02,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 787.0) internal successors, (9444), 12 states have internal predecessors, (9444), 0 states have call successors, (0), 0 states 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:42:02,276 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 787.0) internal successors, (9444), 12 states have internal predecessors, (9444), 0 states have call successors, (0), 0 states 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:42:02,277 INFO L175 Difference]: Start difference. First operand has 700 places, 719 transitions, 1466 flow. Second operand 11 states and 8284 transitions. [2022-11-02 20:42:02,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 739 transitions, 1594 flow [2022-11-02 20:42:02,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 739 transitions, 1588 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:42:02,297 INFO L231 Difference]: Finished difference. Result has 710 places, 725 transitions, 1515 flow [2022-11-02 20:42:02,298 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=710, PETRI_TRANSITIONS=725} [2022-11-02 20:42:02,299 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -13 predicate places. [2022-11-02 20:42:02,299 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 725 transitions, 1515 flow [2022-11-02 20:42:02,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 752.5714285714286) internal successors, (10536), 14 states have internal predecessors, (10536), 0 states have call successors, (0), 0 states 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:42:02,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:02,305 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:02,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35585b7c-a7a9-4ba7-8388-ce4a9128e832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:42:02,530 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1823589763, now seen corresponding path program 2 times [2022-11-02 20:42:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:02,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707854807] [2022-11-02 20:42:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:03,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707854807] [2022-11-02 20:42:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707854807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:03,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:42:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016638142] [2022-11-02 20:42:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:42:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:42:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:42:03,568 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 787 [2022-11-02 20:42:03,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 725 transitions, 1515 flow. Second operand has 6 states, 6 states have (on average 734.6666666666666) internal successors, (4408), 6 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states 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:42:03,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:03,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 787 [2022-11-02 20:42:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:07,716 INFO L130 PetriNetUnfolder]: 1198/11764 cut-off events. [2022-11-02 20:42:07,716 INFO L131 PetriNetUnfolder]: For 20/32 co-relation queries the response was YES. [2022-11-02 20:42:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13015 conditions, 11764 events. 1198/11764 cut-off events. For 20/32 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 121803 event pairs, 300 based on Foata normal form. 4/9424 useless extension candidates. Maximal degree in co-relation 12806. Up to 427 conditions per place. [2022-11-02 20:42:07,909 INFO L137 encePairwiseOnDemand]: 782/787 looper letters, 80 selfloop transitions, 4 changer transitions 0/772 dead transitions. [2022-11-02 20:42:07,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 772 transitions, 1777 flow [2022-11-02 20:42:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:42:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:42:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4477 transitions. [2022-11-02 20:42:07,919 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9481152054214316 [2022-11-02 20:42:07,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4477 transitions. [2022-11-02 20:42:07,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4477 transitions. [2022-11-02 20:42:07,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:07,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4477 transitions. [2022-11-02 20:42:07,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 746.1666666666666) internal successors, (4477), 6 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states 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:42:07,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:42:07,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:42:07,945 INFO L175 Difference]: Start difference. First operand has 710 places, 725 transitions, 1515 flow. Second operand 6 states and 4477 transitions. [2022-11-02 20:42:07,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 772 transitions, 1777 flow [2022-11-02 20:42:07,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 772 transitions, 1768 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-02 20:42:07,964 INFO L231 Difference]: Finished difference. Result has 711 places, 724 transitions, 1512 flow [2022-11-02 20:42:07,965 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=711, PETRI_TRANSITIONS=724} [2022-11-02 20:42:07,966 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -12 predicate places. [2022-11-02 20:42:07,966 INFO L495 AbstractCegarLoop]: Abstraction has has 711 places, 724 transitions, 1512 flow [2022-11-02 20:42:07,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.6666666666666) internal successors, (4408), 6 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states 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:42:07,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:07,970 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:07,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:42:07,970 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1312333516, now seen corresponding path program 1 times [2022-11-02 20:42:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:07,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302633473] [2022-11-02 20:42:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302633473] [2022-11-02 20:42:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302633473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:08,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876382696] [2022-11-02 20:42:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:08,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:08,062 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 787 [2022-11-02 20:42:08,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 724 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:42:08,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:08,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 787 [2022-11-02 20:42:08,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:09,383 INFO L130 PetriNetUnfolder]: 399/5542 cut-off events. [2022-11-02 20:42:09,384 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-02 20:42:09,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5906 conditions, 5542 events. 399/5542 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43614 event pairs, 100 based on Foata normal form. 0/4495 useless extension candidates. Maximal degree in co-relation 5716. Up to 304 conditions per place. [2022-11-02 20:42:09,436 INFO L137 encePairwiseOnDemand]: 775/787 looper letters, 27 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2022-11-02 20:42:09,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 717 transitions, 1557 flow [2022-11-02 20:42:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2022-11-02 20:42:09,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9504447268106735 [2022-11-02 20:42:09,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2244 transitions. [2022-11-02 20:42:09,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2244 transitions. [2022-11-02 20:42:09,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:09,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2244 transitions. [2022-11-02 20:42:09,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states 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:42:09,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:09,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:09,457 INFO L175 Difference]: Start difference. First operand has 711 places, 724 transitions, 1512 flow. Second operand 3 states and 2244 transitions. [2022-11-02 20:42:09,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 717 transitions, 1557 flow [2022-11-02 20:42:09,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 717 transitions, 1550 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:42:09,473 INFO L231 Difference]: Finished difference. Result has 700 places, 716 transitions, 1499 flow [2022-11-02 20:42:09,475 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1499, PETRI_PLACES=700, PETRI_TRANSITIONS=716} [2022-11-02 20:42:09,475 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -23 predicate places. [2022-11-02 20:42:09,475 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 716 transitions, 1499 flow [2022-11-02 20:42:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:42:09,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:09,477 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:42:09,478 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -663132472, now seen corresponding path program 1 times [2022-11-02 20:42:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:09,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418574602] [2022-11-02 20:42:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:09,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418574602] [2022-11-02 20:42:09,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418574602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:09,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455065868] [2022-11-02 20:42:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:09,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:09,563 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:42:09,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 716 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states 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:42:09,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:09,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:42:09,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:10,058 INFO L130 PetriNetUnfolder]: 102/1523 cut-off events. [2022-11-02 20:42:10,058 INFO L131 PetriNetUnfolder]: For 43/44 co-relation queries the response was YES. [2022-11-02 20:42:10,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 1523 events. 102/1523 cut-off events. For 43/44 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9182 event pairs, 2 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1565. Up to 178 conditions per place. [2022-11-02 20:42:10,084 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 42 selfloop transitions, 2 changer transitions 0/716 dead transitions. [2022-11-02 20:42:10,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 716 transitions, 1588 flow [2022-11-02 20:42:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2226 transitions. [2022-11-02 20:42:10,090 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9428208386277002 [2022-11-02 20:42:10,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2226 transitions. [2022-11-02 20:42:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2226 transitions. [2022-11-02 20:42:10,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:10,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2226 transitions. [2022-11-02 20:42:10,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states 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:42:10,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:10,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:10,103 INFO L175 Difference]: Start difference. First operand has 700 places, 716 transitions, 1499 flow. Second operand 3 states and 2226 transitions. [2022-11-02 20:42:10,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 716 transitions, 1588 flow [2022-11-02 20:42:10,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 716 transitions, 1588 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:42:10,119 INFO L231 Difference]: Finished difference. Result has 701 places, 715 transitions, 1501 flow [2022-11-02 20:42:10,120 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=701, PETRI_TRANSITIONS=715} [2022-11-02 20:42:10,121 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -22 predicate places. [2022-11-02 20:42:10,121 INFO L495 AbstractCegarLoop]: Abstraction has has 701 places, 715 transitions, 1501 flow [2022-11-02 20:42:10,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states 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:42:10,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:10,123 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:42:10,123 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1361306806, now seen corresponding path program 1 times [2022-11-02 20:42:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239076455] [2022-11-02 20:42:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:10,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:10,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239076455] [2022-11-02 20:42:10,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239076455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8144888] [2022-11-02 20:42:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:10,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:10,224 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 787 [2022-11-02 20:42:10,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 715 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:42:10,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:10,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 787 [2022-11-02 20:42:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:10,670 INFO L130 PetriNetUnfolder]: 97/1764 cut-off events. [2022-11-02 20:42:10,670 INFO L131 PetriNetUnfolder]: For 6/19 co-relation queries the response was YES. [2022-11-02 20:42:10,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1764 events. 97/1764 cut-off events. For 6/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9878 event pairs, 12 based on Foata normal form. 1/1486 useless extension candidates. Maximal degree in co-relation 1726. Up to 51 conditions per place. [2022-11-02 20:42:10,693 INFO L137 encePairwiseOnDemand]: 772/787 looper letters, 26 selfloop transitions, 9 changer transitions 0/714 dead transitions. [2022-11-02 20:42:10,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 714 transitions, 1570 flow [2022-11-02 20:42:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2246 transitions. [2022-11-02 20:42:10,699 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9512918254976704 [2022-11-02 20:42:10,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2246 transitions. [2022-11-02 20:42:10,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2246 transitions. [2022-11-02 20:42:10,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:10,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2246 transitions. [2022-11-02 20:42:10,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 748.6666666666666) internal successors, (2246), 3 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states 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:42:10,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:10,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:10,710 INFO L175 Difference]: Start difference. First operand has 701 places, 715 transitions, 1501 flow. Second operand 3 states and 2246 transitions. [2022-11-02 20:42:10,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 714 transitions, 1570 flow [2022-11-02 20:42:10,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 714 transitions, 1566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:10,726 INFO L231 Difference]: Finished difference. Result has 696 places, 713 transitions, 1528 flow [2022-11-02 20:42:10,727 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=696, PETRI_TRANSITIONS=713} [2022-11-02 20:42:10,728 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -27 predicate places. [2022-11-02 20:42:10,728 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 713 transitions, 1528 flow [2022-11-02 20:42:10,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:42:10,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:10,730 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:10,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:42:10,730 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1582028891, now seen corresponding path program 1 times [2022-11-02 20:42:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141584974] [2022-11-02 20:42:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141584974] [2022-11-02 20:42:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141584974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171571258] [2022-11-02 20:42:10,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:10,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:10,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:10,867 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 787 [2022-11-02 20:42:10,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 713 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 735.0) internal successors, (2205), 3 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:10,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:10,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 787 [2022-11-02 20:42:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:11,410 INFO L130 PetriNetUnfolder]: 111/2030 cut-off events. [2022-11-02 20:42:11,410 INFO L131 PetriNetUnfolder]: For 46/60 co-relation queries the response was YES. [2022-11-02 20:42:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 2030 events. 111/2030 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 12252 event pairs, 20 based on Foata normal form. 1/1707 useless extension candidates. Maximal degree in co-relation 2032. Up to 77 conditions per place. [2022-11-02 20:42:11,435 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 33 selfloop transitions, 3 changer transitions 0/713 dead transitions. [2022-11-02 20:42:11,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 713 transitions, 1601 flow [2022-11-02 20:42:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-02 20:42:11,450 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9453621346886912 [2022-11-02 20:42:11,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-02 20:42:11,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-02 20:42:11,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:11,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-02 20:42:11,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:11,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:11,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:11,468 INFO L175 Difference]: Start difference. First operand has 696 places, 713 transitions, 1528 flow. Second operand 3 states and 2232 transitions. [2022-11-02 20:42:11,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 713 transitions, 1601 flow [2022-11-02 20:42:11,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1592 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:42:11,485 INFO L231 Difference]: Finished difference. Result has 696 places, 712 transitions, 1523 flow [2022-11-02 20:42:11,486 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1523, PETRI_PLACES=696, PETRI_TRANSITIONS=712} [2022-11-02 20:42:11,487 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -27 predicate places. [2022-11-02 20:42:11,487 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 712 transitions, 1523 flow [2022-11-02 20:42:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.0) internal successors, (2205), 3 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:11,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:11,488 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:11,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:42:11,489 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2128219153, now seen corresponding path program 1 times [2022-11-02 20:42:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:11,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946017256] [2022-11-02 20:42:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:11,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946017256] [2022-11-02 20:42:11,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946017256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:11,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:11,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884447672] [2022-11-02 20:42:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:11,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:11,587 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 787 [2022-11-02 20:42:11,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 712 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:11,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:11,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 787 [2022-11-02 20:42:11,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:12,080 INFO L130 PetriNetUnfolder]: 85/1552 cut-off events. [2022-11-02 20:42:12,080 INFO L131 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2022-11-02 20:42:12,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1552 events. 85/1552 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8789 event pairs, 13 based on Foata normal form. 1/1329 useless extension candidates. Maximal degree in co-relation 1550. Up to 83 conditions per place. [2022-11-02 20:42:12,116 INFO L137 encePairwiseOnDemand]: 772/787 looper letters, 22 selfloop transitions, 8 changer transitions 18/711 dead transitions. [2022-11-02 20:42:12,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 711 transitions, 1590 flow [2022-11-02 20:42:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2245 transitions. [2022-11-02 20:42:12,121 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9508682761541719 [2022-11-02 20:42:12,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2245 transitions. [2022-11-02 20:42:12,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2245 transitions. [2022-11-02 20:42:12,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:12,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2245 transitions. [2022-11-02 20:42:12,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states 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:42:12,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:12,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:12,130 INFO L175 Difference]: Start difference. First operand has 696 places, 712 transitions, 1523 flow. Second operand 3 states and 2245 transitions. [2022-11-02 20:42:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 711 transitions, 1590 flow [2022-11-02 20:42:12,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 711 transitions, 1584 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:12,144 INFO L231 Difference]: Finished difference. Result has 691 places, 692 transitions, 1506 flow [2022-11-02 20:42:12,145 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=691, PETRI_TRANSITIONS=692} [2022-11-02 20:42:12,146 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -32 predicate places. [2022-11-02 20:42:12,146 INFO L495 AbstractCegarLoop]: Abstraction has has 691 places, 692 transitions, 1506 flow [2022-11-02 20:42:12,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:12,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:12,147 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:12,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:42:12,148 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash 502888788, now seen corresponding path program 1 times [2022-11-02 20:42:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311834959] [2022-11-02 20:42:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:12,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311834959] [2022-11-02 20:42:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311834959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:12,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:12,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232465986] [2022-11-02 20:42:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:12,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:12,234 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 787 [2022-11-02 20:42:12,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 692 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:12,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:12,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 787 [2022-11-02 20:42:12,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:12,672 INFO L130 PetriNetUnfolder]: 85/1501 cut-off events. [2022-11-02 20:42:12,672 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-11-02 20:42:12,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1501 events. 85/1501 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8488 event pairs, 20 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 1565. Up to 118 conditions per place. [2022-11-02 20:42:12,696 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 28 selfloop transitions, 3 changer transitions 0/692 dead transitions. [2022-11-02 20:42:12,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 692 transitions, 1569 flow [2022-11-02 20:42:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2022-11-02 20:42:12,699 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9432443879711987 [2022-11-02 20:42:12,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2227 transitions. [2022-11-02 20:42:12,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2227 transitions. [2022-11-02 20:42:12,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:12,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2227 transitions. [2022-11-02 20:42:12,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states 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:42:12,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:12,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:12,708 INFO L175 Difference]: Start difference. First operand has 691 places, 692 transitions, 1506 flow. Second operand 3 states and 2227 transitions. [2022-11-02 20:42:12,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 692 transitions, 1569 flow [2022-11-02 20:42:12,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 692 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:42:12,723 INFO L231 Difference]: Finished difference. Result has 675 places, 691 transitions, 1502 flow [2022-11-02 20:42:12,724 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=675, PETRI_TRANSITIONS=691} [2022-11-02 20:42:12,725 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -48 predicate places. [2022-11-02 20:42:12,725 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 691 transitions, 1502 flow [2022-11-02 20:42:12,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:12,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:12,726 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:12,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:42:12,726 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1773939006, now seen corresponding path program 1 times [2022-11-02 20:42:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:12,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233146605] [2022-11-02 20:42:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233146605] [2022-11-02 20:42:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233146605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:12,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:12,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:42:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200524162] [2022-11-02 20:42:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:12,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:12,816 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 787 [2022-11-02 20:42:12,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 691 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states 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:42:12,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:12,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 787 [2022-11-02 20:42:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:14,848 INFO L130 PetriNetUnfolder]: 686/9047 cut-off events. [2022-11-02 20:42:14,849 INFO L131 PetriNetUnfolder]: For 69/70 co-relation queries the response was YES. [2022-11-02 20:42:14,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 9047 events. 686/9047 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 89833 event pairs, 138 based on Foata normal form. 0/7517 useless extension candidates. Maximal degree in co-relation 10004. Up to 386 conditions per place. [2022-11-02 20:42:14,961 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 45 selfloop transitions, 4 changer transitions 0/711 dead transitions. [2022-11-02 20:42:14,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 711 transitions, 1642 flow [2022-11-02 20:42:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2022-11-02 20:42:14,965 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9652689538331216 [2022-11-02 20:42:14,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2279 transitions. [2022-11-02 20:42:14,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2279 transitions. [2022-11-02 20:42:14,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:14,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2279 transitions. [2022-11-02 20:42:14,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 759.6666666666666) internal successors, (2279), 3 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states 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:42:14,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:14,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:14,973 INFO L175 Difference]: Start difference. First operand has 675 places, 691 transitions, 1502 flow. Second operand 3 states and 2279 transitions. [2022-11-02 20:42:14,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 711 transitions, 1642 flow [2022-11-02 20:42:14,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 711 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:14,988 INFO L231 Difference]: Finished difference. Result has 677 places, 695 transitions, 1536 flow [2022-11-02 20:42:14,989 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=677, PETRI_TRANSITIONS=695} [2022-11-02 20:42:14,990 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -46 predicate places. [2022-11-02 20:42:14,990 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 695 transitions, 1536 flow [2022-11-02 20:42:14,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states 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:42:14,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:14,991 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:14,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:42:14,992 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1079606364, now seen corresponding path program 1 times [2022-11-02 20:42:14,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985053011] [2022-11-02 20:42:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985053011] [2022-11-02 20:42:15,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985053011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:15,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:15,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477555361] [2022-11-02 20:42:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:15,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:15,072 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 787 [2022-11-02 20:42:15,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 695 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:15,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:15,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 787 [2022-11-02 20:42:15,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:16,326 INFO L130 PetriNetUnfolder]: 291/5679 cut-off events. [2022-11-02 20:42:16,326 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-02 20:42:16,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 5679 events. 291/5679 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53716 event pairs, 26 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 6189. Up to 172 conditions per place. [2022-11-02 20:42:16,426 INFO L137 encePairwiseOnDemand]: 770/787 looper letters, 28 selfloop transitions, 9 changer transitions 0/692 dead transitions. [2022-11-02 20:42:16,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 692 transitions, 1605 flow [2022-11-02 20:42:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-02 20:42:16,429 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9453621346886912 [2022-11-02 20:42:16,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-02 20:42:16,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-02 20:42:16,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:16,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-02 20:42:16,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:16,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:16,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:16,437 INFO L175 Difference]: Start difference. First operand has 677 places, 695 transitions, 1536 flow. Second operand 3 states and 2232 transitions. [2022-11-02 20:42:16,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 692 transitions, 1605 flow [2022-11-02 20:42:16,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 692 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:42:16,451 INFO L231 Difference]: Finished difference. Result has 672 places, 691 transitions, 1568 flow [2022-11-02 20:42:16,452 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1568, PETRI_PLACES=672, PETRI_TRANSITIONS=691} [2022-11-02 20:42:16,453 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -51 predicate places. [2022-11-02 20:42:16,453 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 691 transitions, 1568 flow [2022-11-02 20:42:16,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:16,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:16,454 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:16,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:42:16,454 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2111517799, now seen corresponding path program 1 times [2022-11-02 20:42:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459985966] [2022-11-02 20:42:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:16,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:16,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459985966] [2022-11-02 20:42:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459985966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:16,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:16,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854553113] [2022-11-02 20:42:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:16,532 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:42:16,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 691 transitions, 1568 flow. Second operand has 3 states, 3 states have (on average 729.6666666666666) internal successors, (2189), 3 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states 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:42:16,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:16,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:42:16,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:17,886 INFO L130 PetriNetUnfolder]: 293/5673 cut-off events. [2022-11-02 20:42:17,887 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-11-02 20:42:17,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 5673 events. 293/5673 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53634 event pairs, 54 based on Foata normal form. 0/4836 useless extension candidates. Maximal degree in co-relation 6351. Up to 271 conditions per place. [2022-11-02 20:42:17,999 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 35 selfloop transitions, 3 changer transitions 0/691 dead transitions. [2022-11-02 20:42:17,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 691 transitions, 1645 flow [2022-11-02 20:42:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2022-11-02 20:42:18,002 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.938585345192715 [2022-11-02 20:42:18,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2216 transitions. [2022-11-02 20:42:18,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2216 transitions. [2022-11-02 20:42:18,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:18,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2216 transitions. [2022-11-02 20:42:18,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.6666666666666) internal successors, (2216), 3 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:18,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:18,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:18,010 INFO L175 Difference]: Start difference. First operand has 672 places, 691 transitions, 1568 flow. Second operand 3 states and 2216 transitions. [2022-11-02 20:42:18,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 691 transitions, 1645 flow [2022-11-02 20:42:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 691 transitions, 1627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:18,027 INFO L231 Difference]: Finished difference. Result has 671 places, 690 transitions, 1554 flow [2022-11-02 20:42:18,029 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=671, PETRI_TRANSITIONS=690} [2022-11-02 20:42:18,029 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -52 predicate places. [2022-11-02 20:42:18,030 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 690 transitions, 1554 flow [2022-11-02 20:42:18,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.6666666666666) internal successors, (2189), 3 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states 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:42:18,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:18,031 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:42:18,032 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1696197739, now seen corresponding path program 1 times [2022-11-02 20:42:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:18,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491004530] [2022-11-02 20:42:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:18,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491004530] [2022-11-02 20:42:18,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491004530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:18,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:18,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408652262] [2022-11-02 20:42:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:18,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:18,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:18,120 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 787 [2022-11-02 20:42:18,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 690 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states 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:42:18,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:18,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 787 [2022-11-02 20:42:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:19,745 INFO L130 PetriNetUnfolder]: 344/5844 cut-off events. [2022-11-02 20:42:19,745 INFO L131 PetriNetUnfolder]: For 116/118 co-relation queries the response was YES. [2022-11-02 20:42:19,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 5844 events. 344/5844 cut-off events. For 116/118 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 57420 event pairs, 30 based on Foata normal form. 0/5011 useless extension candidates. Maximal degree in co-relation 6542. Up to 262 conditions per place. [2022-11-02 20:42:19,885 INFO L137 encePairwiseOnDemand]: 770/787 looper letters, 28 selfloop transitions, 9 changer transitions 0/687 dead transitions. [2022-11-02 20:42:19,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 687 transitions, 1623 flow [2022-11-02 20:42:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-02 20:42:19,888 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9453621346886912 [2022-11-02 20:42:19,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-02 20:42:19,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-02 20:42:19,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:19,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-02 20:42:19,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:19,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:19,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:19,895 INFO L175 Difference]: Start difference. First operand has 671 places, 690 transitions, 1554 flow. Second operand 3 states and 2232 transitions. [2022-11-02 20:42:19,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 687 transitions, 1623 flow [2022-11-02 20:42:19,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1617 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:19,909 INFO L231 Difference]: Finished difference. Result has 665 places, 686 transitions, 1584 flow [2022-11-02 20:42:19,910 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=665, PETRI_TRANSITIONS=686} [2022-11-02 20:42:19,911 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -58 predicate places. [2022-11-02 20:42:19,911 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 686 transitions, 1584 flow [2022-11-02 20:42:19,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states 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:42:19,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:19,913 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:19,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:42:19,913 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1960936800, now seen corresponding path program 1 times [2022-11-02 20:42:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336223142] [2022-11-02 20:42:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:19,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336223142] [2022-11-02 20:42:19,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336223142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:19,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:19,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818882440] [2022-11-02 20:42:19,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:19,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:19,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:19,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:19,987 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:42:19,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 686 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states 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:42:19,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:19,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:42:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:21,557 INFO L130 PetriNetUnfolder]: 348/5836 cut-off events. [2022-11-02 20:42:21,557 INFO L131 PetriNetUnfolder]: For 422/424 co-relation queries the response was YES. [2022-11-02 20:42:21,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 5836 events. 348/5836 cut-off events. For 422/424 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 57473 event pairs, 61 based on Foata normal form. 0/5013 useless extension candidates. Maximal degree in co-relation 6771. Up to 424 conditions per place. [2022-11-02 20:42:21,701 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 35 selfloop transitions, 3 changer transitions 0/686 dead transitions. [2022-11-02 20:42:21,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 686 transitions, 1661 flow [2022-11-02 20:42:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2022-11-02 20:42:21,704 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.938585345192715 [2022-11-02 20:42:21,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2216 transitions. [2022-11-02 20:42:21,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2216 transitions. [2022-11-02 20:42:21,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:21,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2216 transitions. [2022-11-02 20:42:21,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.6666666666666) internal successors, (2216), 3 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:21,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:21,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:21,710 INFO L175 Difference]: Start difference. First operand has 665 places, 686 transitions, 1584 flow. Second operand 3 states and 2216 transitions. [2022-11-02 20:42:21,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 686 transitions, 1661 flow [2022-11-02 20:42:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 686 transitions, 1643 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:21,725 INFO L231 Difference]: Finished difference. Result has 664 places, 685 transitions, 1570 flow [2022-11-02 20:42:21,725 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1570, PETRI_PLACES=664, PETRI_TRANSITIONS=685} [2022-11-02 20:42:21,726 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -59 predicate places. [2022-11-02 20:42:21,726 INFO L495 AbstractCegarLoop]: Abstraction has has 664 places, 685 transitions, 1570 flow [2022-11-02 20:42:21,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states 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:42:21,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:21,727 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:21,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:42:21,727 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 355579183, now seen corresponding path program 1 times [2022-11-02 20:42:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718899888] [2022-11-02 20:42:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:21,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:21,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718899888] [2022-11-02 20:42:21,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718899888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:21,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:21,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669232538] [2022-11-02 20:42:21,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:21,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:21,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:21,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 787 [2022-11-02 20:42:21,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 685 transitions, 1570 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:42:21,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:21,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 787 [2022-11-02 20:42:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:23,356 INFO L130 PetriNetUnfolder]: 268/5727 cut-off events. [2022-11-02 20:42:23,356 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-02 20:42:23,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 5727 events. 268/5727 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 55071 event pairs, 14 based on Foata normal form. 0/4983 useless extension candidates. Maximal degree in co-relation 6303. Up to 106 conditions per place. [2022-11-02 20:42:23,481 INFO L137 encePairwiseOnDemand]: 780/787 looper letters, 16 selfloop transitions, 3 changer transitions 0/682 dead transitions. [2022-11-02 20:42:23,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 682 transitions, 1603 flow [2022-11-02 20:42:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2022-11-02 20:42:23,483 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9589157136806438 [2022-11-02 20:42:23,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2264 transitions. [2022-11-02 20:42:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2264 transitions. [2022-11-02 20:42:23,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:23,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2264 transitions. [2022-11-02 20:42:23,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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:42:23,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:23,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:23,489 INFO L175 Difference]: Start difference. First operand has 664 places, 685 transitions, 1570 flow. Second operand 3 states and 2264 transitions. [2022-11-02 20:42:23,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 682 transitions, 1603 flow [2022-11-02 20:42:23,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:23,504 INFO L231 Difference]: Finished difference. Result has 660 places, 681 transitions, 1562 flow [2022-11-02 20:42:23,505 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=660, PETRI_TRANSITIONS=681} [2022-11-02 20:42:23,506 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -63 predicate places. [2022-11-02 20:42:23,506 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 681 transitions, 1562 flow [2022-11-02 20:42:23,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:42:23,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:23,507 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:23,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:42:23,507 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2035406567, now seen corresponding path program 1 times [2022-11-02 20:42:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:23,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655341232] [2022-11-02 20:42:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655341232] [2022-11-02 20:42:23,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655341232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:23,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:23,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195281745] [2022-11-02 20:42:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:23,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:23,609 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 787 [2022-11-02 20:42:23,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 681 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:23,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:23,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 787 [2022-11-02 20:42:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:25,056 INFO L130 PetriNetUnfolder]: 301/5704 cut-off events. [2022-11-02 20:42:25,056 INFO L131 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2022-11-02 20:42:25,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 5704 events. 301/5704 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54161 event pairs, 18 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 6335. Up to 162 conditions per place. [2022-11-02 20:42:25,154 INFO L137 encePairwiseOnDemand]: 780/787 looper letters, 16 selfloop transitions, 3 changer transitions 0/678 dead transitions. [2022-11-02 20:42:25,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 678 transitions, 1595 flow [2022-11-02 20:42:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2022-11-02 20:42:25,157 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9589157136806438 [2022-11-02 20:42:25,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2264 transitions. [2022-11-02 20:42:25,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2264 transitions. [2022-11-02 20:42:25,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:25,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2264 transitions. [2022-11-02 20:42:25,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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:42:25,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:25,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:25,161 INFO L175 Difference]: Start difference. First operand has 660 places, 681 transitions, 1562 flow. Second operand 3 states and 2264 transitions. [2022-11-02 20:42:25,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 678 transitions, 1595 flow [2022-11-02 20:42:25,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 678 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:25,174 INFO L231 Difference]: Finished difference. Result has 656 places, 677 transitions, 1554 flow [2022-11-02 20:42:25,175 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=656, PETRI_TRANSITIONS=677} [2022-11-02 20:42:25,176 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -67 predicate places. [2022-11-02 20:42:25,176 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 677 transitions, 1554 flow [2022-11-02 20:42:25,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:42:25,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:25,177 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:42:25,177 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1788474682, now seen corresponding path program 1 times [2022-11-02 20:42:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:25,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863624298] [2022-11-02 20:42:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:25,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863624298] [2022-11-02 20:42:25,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863624298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:25,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927842463] [2022-11-02 20:42:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:25,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:25,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:25,259 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 787 [2022-11-02 20:42:25,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 677 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states 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:42:25,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:25,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 787 [2022-11-02 20:42:25,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:27,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,730 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-02 20:42:27,730 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,731 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:27,731 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-02 20:42:27,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,737 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-02 20:42:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,737 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-02 20:42:27,751 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 418#L55-2true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,751 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-02 20:42:27,752 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:27,752 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:27,752 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-02 20:42:27,772 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,773 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:27,773 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,773 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:27,773 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,773 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,774 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:27,774 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,774 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,774 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,775 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,775 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:27,775 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,776 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,776 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:27,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,776 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:27,776 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,777 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,777 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,783 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:27,783 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,783 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:27,783 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,787 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:27,787 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,787 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:27,787 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,804 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 418#L55-2true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,804 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:27,805 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,805 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,805 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 418#L55-2true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,808 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:27,808 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,808 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:27,808 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:27,833 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,834 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:27,834 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:27,834 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:27,834 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:27,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,835 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-02 20:42:27,835 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,835 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:27,835 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:27,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,841 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:27,841 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:27,841 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:27,841 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:27,856 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 418#L55-2true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,856 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-02 20:42:27,856 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:27,857 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:27,857 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:27,953 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2302] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][519], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,954 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-02 20:42:27,954 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-02 20:42:27,954 INFO L386 tUnfolder$Statistics]: existing Event has 298 ancestors and is cut-off event [2022-11-02 20:42:27,954 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-02 20:42:27,955 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2302] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][519], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,955 INFO L383 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-11-02 20:42:27,955 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-02 20:42:27,955 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:42:27,955 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-02 20:42:27,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2302] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][519], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,976 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-02 20:42:27,976 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:42:27,976 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:42:27,976 INFO L386 tUnfolder$Statistics]: existing Event has 301 ancestors and is cut-off event [2022-11-02 20:42:27,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2302] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][519], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 632#L76-2true, 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 1881#(= |#race~i_8~0| 0), 819#(= |#race~name_1~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:27,976 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-02 20:42:27,977 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-02 20:42:27,977 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-02 20:42:27,977 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-02 20:42:28,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:28,011 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-02 20:42:28,011 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-02 20:42:28,011 INFO L386 tUnfolder$Statistics]: existing Event has 386 ancestors and is cut-off event [2022-11-02 20:42:28,012 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-02 20:42:28,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1881#(= |#race~i_8~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:28,028 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-02 20:42:28,028 INFO L386 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-11-02 20:42:28,029 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-02 20:42:28,029 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-02 20:42:28,107 INFO L130 PetriNetUnfolder]: 565/10690 cut-off events. [2022-11-02 20:42:28,108 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-11-02 20:42:28,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 10690 events. 565/10690 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 108552 event pairs, 22 based on Foata normal form. 0/9354 useless extension candidates. Maximal degree in co-relation 11829. Up to 298 conditions per place. [2022-11-02 20:42:28,289 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 11 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2022-11-02 20:42:28,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 679 transitions, 1586 flow [2022-11-02 20:42:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2022-11-02 20:42:28,292 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9707750952986023 [2022-11-02 20:42:28,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2292 transitions. [2022-11-02 20:42:28,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2292 transitions. [2022-11-02 20:42:28,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:28,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2292 transitions. [2022-11-02 20:42:28,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states 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:42:28,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:28,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:28,298 INFO L175 Difference]: Start difference. First operand has 656 places, 677 transitions, 1554 flow. Second operand 3 states and 2292 transitions. [2022-11-02 20:42:28,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 679 transitions, 1586 flow [2022-11-02 20:42:28,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 679 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:42:28,311 INFO L231 Difference]: Finished difference. Result has 655 places, 677 transitions, 1558 flow [2022-11-02 20:42:28,312 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1558, PETRI_PLACES=655, PETRI_TRANSITIONS=677} [2022-11-02 20:42:28,313 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -68 predicate places. [2022-11-02 20:42:28,313 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 677 transitions, 1558 flow [2022-11-02 20:42:28,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states 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:42:28,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:28,314 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:28,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:42:28,314 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1997071221, now seen corresponding path program 1 times [2022-11-02 20:42:28,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:28,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374524173] [2022-11-02 20:42:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:28,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374524173] [2022-11-02 20:42:28,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374524173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:28,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:28,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920227324] [2022-11-02 20:42:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:28,465 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 787 [2022-11-02 20:42:28,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 677 transitions, 1558 flow. Second operand has 4 states, 4 states have (on average 752.5) internal successors, (3010), 4 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:42:28,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:28,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 787 [2022-11-02 20:42:28,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:30,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:30,867 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:30,867 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:30,870 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:30,870 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:30,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:30,917 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:30,917 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:30,917 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:30,918 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:31,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:31,613 INFO L383 tUnfolder$Statistics]: this new event has 454 ancestors and is cut-off event [2022-11-02 20:42:31,613 INFO L386 tUnfolder$Statistics]: existing Event has 366 ancestors and is cut-off event [2022-11-02 20:42:31,613 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:42:31,613 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:42:31,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:31,630 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:42:31,631 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:31,631 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:31,631 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:42:31,632 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:31,632 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:42:31,632 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:42:31,632 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:31,632 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:31,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:31,651 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-02 20:42:31,651 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:42:31,651 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-02 20:42:31,651 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:42:31,752 INFO L130 PetriNetUnfolder]: 519/10122 cut-off events. [2022-11-02 20:42:31,752 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-02 20:42:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11678 conditions, 10122 events. 519/10122 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 94362 event pairs, 62 based on Foata normal form. 0/8920 useless extension candidates. Maximal degree in co-relation 11482. Up to 258 conditions per place. [2022-11-02 20:42:32,003 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 33 selfloop transitions, 8 changer transitions 0/696 dead transitions. [2022-11-02 20:42:32,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 696 transitions, 1682 flow [2022-11-02 20:42:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:42:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3787 transitions. [2022-11-02 20:42:32,007 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9623888182973317 [2022-11-02 20:42:32,007 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3787 transitions. [2022-11-02 20:42:32,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3787 transitions. [2022-11-02 20:42:32,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:32,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3787 transitions. [2022-11-02 20:42:32,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 757.4) internal successors, (3787), 5 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states 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:42:32,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:42:32,017 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:42:32,017 INFO L175 Difference]: Start difference. First operand has 655 places, 677 transitions, 1558 flow. Second operand 5 states and 3787 transitions. [2022-11-02 20:42:32,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 696 transitions, 1682 flow [2022-11-02 20:42:32,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 696 transitions, 1682 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:42:32,035 INFO L231 Difference]: Finished difference. Result has 662 places, 681 transitions, 1604 flow [2022-11-02 20:42:32,036 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1604, PETRI_PLACES=662, PETRI_TRANSITIONS=681} [2022-11-02 20:42:32,036 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -61 predicate places. [2022-11-02 20:42:32,036 INFO L495 AbstractCegarLoop]: Abstraction has has 662 places, 681 transitions, 1604 flow [2022-11-02 20:42:32,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 752.5) internal successors, (3010), 4 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states 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:42:32,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:32,038 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:32,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:42:32,038 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1076193086, now seen corresponding path program 1 times [2022-11-02 20:42:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:32,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204505706] [2022-11-02 20:42:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:32,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:32,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204505706] [2022-11-02 20:42:32,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204505706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:32,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:32,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:42:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677124758] [2022-11-02 20:42:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:32,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:32,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:42:32,140 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 787 [2022-11-02 20:42:32,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 681 transitions, 1604 flow. Second operand has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states 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:42:32,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:32,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 787 [2022-11-02 20:42:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:34,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:34,695 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:34,695 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:34,695 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:34,695 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:34,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:34,741 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:34,741 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:34,741 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:34,741 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:35,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:35,304 INFO L383 tUnfolder$Statistics]: this new event has 454 ancestors and is cut-off event [2022-11-02 20:42:35,304 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:42:35,304 INFO L386 tUnfolder$Statistics]: existing Event has 366 ancestors and is cut-off event [2022-11-02 20:42:35,304 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:42:35,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:35,319 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:42:35,319 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:35,319 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:35,319 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:42:35,321 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:35,321 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:42:35,321 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:35,321 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:42:35,321 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:42:35,337 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:35,337 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-02 20:42:35,337 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:42:35,337 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:42:35,337 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-02 20:42:35,412 INFO L130 PetriNetUnfolder]: 597/11919 cut-off events. [2022-11-02 20:42:35,412 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-11-02 20:42:35,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13954 conditions, 11919 events. 597/11919 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 117932 event pairs, 92 based on Foata normal form. 0/10522 useless extension candidates. Maximal degree in co-relation 13751. Up to 515 conditions per place. [2022-11-02 20:42:35,628 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 27 selfloop transitions, 3 changer transitions 0/681 dead transitions. [2022-11-02 20:42:35,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 681 transitions, 1665 flow [2022-11-02 20:42:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:42:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2226 transitions. [2022-11-02 20:42:35,630 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9428208386277002 [2022-11-02 20:42:35,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2226 transitions. [2022-11-02 20:42:35,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2226 transitions. [2022-11-02 20:42:35,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:35,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2226 transitions. [2022-11-02 20:42:35,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states 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:42:35,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:35,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:42:35,634 INFO L175 Difference]: Start difference. First operand has 662 places, 681 transitions, 1604 flow. Second operand 3 states and 2226 transitions. [2022-11-02 20:42:35,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 681 transitions, 1665 flow [2022-11-02 20:42:35,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 681 transitions, 1665 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:42:35,647 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1608 flow [2022-11-02 20:42:35,648 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1608, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2022-11-02 20:42:35,649 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -60 predicate places. [2022-11-02 20:42:35,649 INFO L495 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1608 flow [2022-11-02 20:42:35,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states 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:42:35,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:42:35,650 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:35,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:42:35,650 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:42:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1034223661, now seen corresponding path program 1 times [2022-11-02 20:42:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:35,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979534460] [2022-11-02 20:42:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:42:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:36,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979534460] [2022-11-02 20:42:36,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979534460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:36,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:36,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:42:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803842130] [2022-11-02 20:42:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:36,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:42:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:36,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:42:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:42:36,301 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:42:36,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1608 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states 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:42:36,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:42:36,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:42:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:42:50,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:50,709 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:50,710 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:50,710 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:50,710 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:51,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,423 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-02 20:42:51,423 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:51,423 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:51,423 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-02 20:42:51,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,424 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:51,424 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:51,424 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:51,424 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:51,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,425 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-02 20:42:51,425 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-02 20:42:51,425 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:51,425 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:51,544 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,544 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-02 20:42:51,545 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:51,545 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:51,545 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:51,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,870 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-02 20:42:51,871 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-02 20:42:51,871 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:51,871 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:51,872 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,872 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-02 20:42:51,872 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-02 20:42:51,872 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:51,872 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:51,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,990 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-02 20:42:51,990 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:51,990 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:51,990 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:51,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1848] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,991 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-02 20:42:51,991 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:51,991 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-02 20:42:51,991 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-02 20:42:51,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:51,993 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-02 20:42:51,993 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:51,993 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:51,993 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-02 20:42:52,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), 555#L109-3true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,111 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-02 20:42:52,111 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-02 20:42:52,111 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,111 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, 555#L109-3true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, 142#L62-2true, Black: 1883#true]) [2022-11-02 20:42:52,112 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-02 20:42:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-02 20:42:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,441 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,441 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-02 20:42:52,441 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,441 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,442 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-02 20:42:52,443 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,443 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-02 20:42:52,443 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-02 20:42:52,443 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,443 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,545 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1867#(= |#race~break_10~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 449#L54-3true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,545 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-02 20:42:52,545 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:52,546 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,546 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 142#L62-2true, Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,547 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-02 20:42:52,547 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,547 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,547 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:52,606 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,606 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-02 20:42:52,606 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,606 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,606 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:52,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,607 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-02 20:42:52,608 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-02 20:42:52,608 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,608 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:52,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 819#(= |#race~name_1~0| 0), 167#L109-6true, 209#L76-5true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,648 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:52,648 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,648 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:52,648 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 167#L109-6true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 142#L62-2true, Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,650 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:52,650 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,650 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:52,650 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), 555#L109-3true, Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,703 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:52,703 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,704 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:52,704 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, 555#L109-3true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, 142#L62-2true, Black: 1883#true]) [2022-11-02 20:42:52,705 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:52,705 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,705 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:52,705 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,748 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-02 20:42:52,748 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,748 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:52,748 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-02 20:42:52,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 209#L76-5true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 449#L54-3true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,808 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:52,808 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:52,808 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,808 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:52,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 209#L76-5true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), 142#L62-2true, Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:52,809 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-02 20:42:52,809 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:52,809 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-02 20:42:52,809 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-02 20:42:52,911 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 449#L54-3true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,911 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-02 20:42:52,911 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,911 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-02 20:42:52,911 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-02 20:42:52,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 142#L62-2true, Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:52,913 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-02 20:42:52,913 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-02 20:42:52,914 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-02 20:42:52,914 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-02 20:42:53,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 167#L109-6true, 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 449#L54-3true, 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:53,019 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,021 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 209#L76-5true, 167#L109-6true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 142#L62-2true, Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:42:53,021 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:53,021 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:53,021 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,021 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, 1890#(= ~i_4~0 0), Black: 1833#(= |#race~result_3~0| 0), Black: 1865#true, 819#(= |#race~name_1~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:53,124 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-02 20:42:53,124 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,124 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-02 20:42:53,125 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,223 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:53,223 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-02 20:42:53,223 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:53,223 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-02 20:42:53,223 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-02 20:42:53,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:53,795 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-02 20:42:53,795 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-02 20:42:53,795 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-02 20:42:53,795 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-02 20:42:57,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,014 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-02 20:42:57,014 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-02 20:42:57,014 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-02 20:42:57,014 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 298#L110-3true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,862 INFO L383 tUnfolder$Statistics]: this new event has 394 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 37#L110-5true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,862 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-02 20:42:57,862 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), 591#L110-4true, Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,863 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, 635#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1883#true]) [2022-11-02 20:42:57,863 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:57,863 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 65#L110-2true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,864 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 396#L110-6true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,864 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:57,864 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:57,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 695#L109-7true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:57,865 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-02 20:42:57,865 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:57,865 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:42:57,865 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 298#L110-3true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:58,454 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 37#L110-5true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:58,454 INFO L383 tUnfolder$Statistics]: this new event has 399 ancestors and is cut-off event [2022-11-02 20:42:58,454 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 591#L110-4true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:58,455 INFO L383 tUnfolder$Statistics]: this new event has 398 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, 635#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1883#true]) [2022-11-02 20:42:58,455 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-02 20:42:58,455 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 65#L110-2true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:58,456 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2138] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][375], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), Black: 1822#true, 1898#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1888#true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1890#(= ~i_4~0 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 209#L76-5true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 396#L110-6true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:42:58,456 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-02 20:42:58,456 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-02 20:43:07,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,473 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:43:07,473 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:43:07,473 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:07,473 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:07,473 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,473 INFO L383 tUnfolder$Statistics]: this new event has 454 ancestors and is cut-off event [2022-11-02 20:43:07,473 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:43:07,474 INFO L386 tUnfolder$Statistics]: existing Event has 366 ancestors and is cut-off event [2022-11-02 20:43:07,474 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:43:07,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,876 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-02 20:43:07,876 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:07,876 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:07,876 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-02 20:43:07,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1842#(= |#race~result_7~0| 0), Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 512#L108-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,876 INFO L383 tUnfolder$Statistics]: this new event has 457 ancestors and is cut-off event [2022-11-02 20:43:07,877 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:07,877 INFO L386 tUnfolder$Statistics]: existing Event has 369 ancestors and is cut-off event [2022-11-02 20:43:07,877 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:07,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,981 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:07,981 INFO L383 tUnfolder$Statistics]: this new event has 458 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-02 20:43:07,981 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-02 20:43:08,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 555#L109-3true, Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,081 INFO L383 tUnfolder$Statistics]: this new event has 459 ancestors and is cut-off event [2022-11-02 20:43:08,081 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-02 20:43:08,081 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-02 20:43:08,081 INFO L386 tUnfolder$Statistics]: existing Event has 371 ancestors and is cut-off event [2022-11-02 20:43:08,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 555#L109-3true, Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,082 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-02 20:43:08,082 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,082 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,082 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-02 20:43:08,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,175 INFO L383 tUnfolder$Statistics]: this new event has 460 ancestors and is cut-off event [2022-11-02 20:43:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 372 ancestors and is cut-off event [2022-11-02 20:43:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:08,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,175 INFO L383 tUnfolder$Statistics]: this new event has 463 ancestors and is cut-off event [2022-11-02 20:43:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-02 20:43:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-02 20:43:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-02 20:43:08,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1855#true, 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,265 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-02 20:43:08,265 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,266 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,266 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,324 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-02 20:43:08,324 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,324 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:08,324 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 546#L109-2true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,325 INFO L383 tUnfolder$Statistics]: this new event has 461 ancestors and is cut-off event [2022-11-02 20:43:08,325 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,325 INFO L386 tUnfolder$Statistics]: existing Event has 373 ancestors and is cut-off event [2022-11-02 20:43:08,325 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1855#true, 819#(= |#race~name_1~0| 0), 167#L109-6true, Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,355 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 819#(= |#race~name_1~0| 0), 167#L109-6true, Black: 1867#(= |#race~break_10~0| 0), 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,356 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,356 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-02 20:43:08,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), 555#L109-3true, Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,634 INFO L383 tUnfolder$Statistics]: this new event has 462 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 374 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), 555#L109-3true, Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,635 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,636 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:08,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1857#(= |#race~break_6~0| 0), 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,699 INFO L383 tUnfolder$Statistics]: this new event has 463 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 375 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1822#true, Black: 1855#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 1888#true, 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1902#true, 581#L109-4true, 1885#(= |#race~nondet_0~0| 0), Black: 1849#true, Black: 1883#true]) [2022-11-02 20:43:08,699 INFO L383 tUnfolder$Statistics]: this new event has 466 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 382 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 378 ancestors and is cut-off event [2022-11-02 20:43:08,699 INFO L386 tUnfolder$Statistics]: existing Event has 382 ancestors and is cut-off event [2022-11-02 20:43:08,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1855#true, 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1865#true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,764 INFO L383 tUnfolder$Statistics]: this new event has 467 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 379 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 376#L109-5true, 819#(= |#race~name_1~0| 0), Black: 1865#true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,764 INFO L383 tUnfolder$Statistics]: this new event has 464 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 376 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,764 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,826 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1855#true, 819#(= |#race~name_1~0| 0), Black: 1865#true, 167#L109-6true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), 394#L76-1true, Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,826 INFO L383 tUnfolder$Statistics]: this new event has 468 ancestors and is cut-off event [2022-11-02 20:43:08,826 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L386 tUnfolder$Statistics]: existing Event has 380 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2122] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [Black: 830#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1851#(= ~name_2~0 ~name_1~0), 1898#true, Black: 1857#(= |#race~break_6~0| 0), 819#(= |#race~name_1~0| 0), Black: 1865#true, 167#L109-6true, 1820#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 627#L55-1true, Black: 1810#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1804#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1883#true, Black: 1822#true, 1824#(= |#race~name_2~0| 0), Black: 1890#(= ~i_4~0 0), Black: 1893#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 394#L76-1true, Black: 1833#(= |#race~result_3~0| 0), 1888#true, Black: 1842#(= |#race~result_7~0| 0), Black: 817#true, 1902#true, 1796#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1885#(= |#race~nondet_0~0| 0), Black: 1849#true]) [2022-11-02 20:43:08,827 INFO L383 tUnfolder$Statistics]: this new event has 465 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L386 tUnfolder$Statistics]: existing Event has 381 ancestors and is cut-off event [2022-11-02 20:43:08,827 INFO L386 tUnfolder$Statistics]: existing Event has 377 ancestors and is cut-off event [2022-11-02 20:43:10,909 INFO L130 PetriNetUnfolder]: 17497/133260 cut-off events. [2022-11-02 20:43:10,909 INFO L131 PetriNetUnfolder]: For 2417/2441 co-relation queries the response was YES. [2022-11-02 20:43:12,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167095 conditions, 133260 events. 17497/133260 cut-off events. For 2417/2441 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 2049678 event pairs, 4538 based on Foata normal form. 0/115670 useless extension candidates. Maximal degree in co-relation 166875. Up to 8922 conditions per place. [2022-11-02 20:43:12,955 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 89 selfloop transitions, 6 changer transitions 0/731 dead transitions. [2022-11-02 20:43:12,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 731 transitions, 1908 flow [2022-11-02 20:43:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:43:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4456 transitions. [2022-11-02 20:43:12,961 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9436679373146971 [2022-11-02 20:43:12,961 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4456 transitions. [2022-11-02 20:43:13,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4456 transitions. [2022-11-02 20:43:13,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:13,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4456 transitions. [2022-11-02 20:43:13,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 742.6666666666666) internal successors, (4456), 6 states have internal predecessors, (4456), 0 states have call successors, (0), 0 states 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:43:13,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:43:13,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:43:13,153 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1608 flow. Second operand 6 states and 4456 transitions. [2022-11-02 20:43:13,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 731 transitions, 1908 flow [2022-11-02 20:43:13,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 731 transitions, 1902 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:43:13,228 INFO L231 Difference]: Finished difference. Result has 665 places, 679 transitions, 1612 flow [2022-11-02 20:43:13,229 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1612, PETRI_PLACES=665, PETRI_TRANSITIONS=679} [2022-11-02 20:43:13,229 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -58 predicate places. [2022-11-02 20:43:13,229 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 679 transitions, 1612 flow [2022-11-02 20:43:13,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states 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:43:13,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:13,231 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:13,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:43:13,231 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:43:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 164465604, now seen corresponding path program 1 times [2022-11-02 20:43:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699083054] [2022-11-02 20:43:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:43:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:13,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699083054] [2022-11-02 20:43:13,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699083054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:13,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:13,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373730390] [2022-11-02 20:43:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:13,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:13,373 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 787 [2022-11-02 20:43:13,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 679 transitions, 1612 flow. Second operand has 4 states, 4 states have (on average 752.75) internal successors, (3011), 4 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states 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:43:13,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:13,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 787 [2022-11-02 20:43:13,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:17,420 INFO L130 PetriNetUnfolder]: 823/12988 cut-off events. [2022-11-02 20:43:17,420 INFO L131 PetriNetUnfolder]: For 311/315 co-relation queries the response was YES. [2022-11-02 20:43:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15498 conditions, 12988 events. 823/12988 cut-off events. For 311/315 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 137863 event pairs, 114 based on Foata normal form. 0/11391 useless extension candidates. Maximal degree in co-relation 15294. Up to 652 conditions per place. [2022-11-02 20:43:17,677 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 32 selfloop transitions, 8 changer transitions 0/697 dead transitions. [2022-11-02 20:43:17,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 697 transitions, 1731 flow [2022-11-02 20:43:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:43:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3786 transitions. [2022-11-02 20:43:17,681 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9621346886912325 [2022-11-02 20:43:17,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3786 transitions. [2022-11-02 20:43:17,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3786 transitions. [2022-11-02 20:43:17,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:17,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3786 transitions. [2022-11-02 20:43:17,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 757.2) internal successors, (3786), 5 states have internal predecessors, (3786), 0 states have call successors, (0), 0 states 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:43:17,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:43:17,691 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 787.0) internal successors, (4722), 6 states have internal predecessors, (4722), 0 states have call successors, (0), 0 states 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:43:17,691 INFO L175 Difference]: Start difference. First operand has 665 places, 679 transitions, 1612 flow. Second operand 5 states and 3786 transitions. [2022-11-02 20:43:17,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 697 transitions, 1731 flow [2022-11-02 20:43:17,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 697 transitions, 1719 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:43:17,705 INFO L231 Difference]: Finished difference. Result has 667 places, 683 transitions, 1646 flow [2022-11-02 20:43:17,706 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1646, PETRI_PLACES=667, PETRI_TRANSITIONS=683} [2022-11-02 20:43:17,706 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -56 predicate places. [2022-11-02 20:43:17,706 INFO L495 AbstractCegarLoop]: Abstraction has has 667 places, 683 transitions, 1646 flow [2022-11-02 20:43:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 752.75) internal successors, (3011), 4 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states 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:43:17,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:17,708 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:43:17,708 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:43:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1085343739, now seen corresponding path program 1 times [2022-11-02 20:43:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:17,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582458123] [2022-11-02 20:43:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:43:17,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:17,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582458123] [2022-11-02 20:43:17,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582458123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:17,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:17,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:17,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84285148] [2022-11-02 20:43:17,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:17,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:17,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:17,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:17,782 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 787 [2022-11-02 20:43:17,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 683 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:43:17,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:17,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 787 [2022-11-02 20:43:17,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:21,907 INFO L130 PetriNetUnfolder]: 847/12940 cut-off events. [2022-11-02 20:43:21,907 INFO L131 PetriNetUnfolder]: For 749/753 co-relation queries the response was YES. [2022-11-02 20:43:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15771 conditions, 12940 events. 847/12940 cut-off events. For 749/753 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 137961 event pairs, 178 based on Foata normal form. 0/11373 useless extension candidates. Maximal degree in co-relation 15561. Up to 1083 conditions per place. [2022-11-02 20:43:22,241 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 27 selfloop transitions, 3 changer transitions 0/683 dead transitions. [2022-11-02 20:43:22,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 683 transitions, 1707 flow [2022-11-02 20:43:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:43:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2226 transitions. [2022-11-02 20:43:22,252 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9428208386277002 [2022-11-02 20:43:22,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2226 transitions. [2022-11-02 20:43:22,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2226 transitions. [2022-11-02 20:43:22,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:22,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2226 transitions. [2022-11-02 20:43:22,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states 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:43:22,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:43:22,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:43:22,262 INFO L175 Difference]: Start difference. First operand has 667 places, 683 transitions, 1646 flow. Second operand 3 states and 2226 transitions. [2022-11-02 20:43:22,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 683 transitions, 1707 flow [2022-11-02 20:43:22,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 683 transitions, 1707 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:43:22,280 INFO L231 Difference]: Finished difference. Result has 668 places, 682 transitions, 1650 flow [2022-11-02 20:43:22,281 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=668, PETRI_TRANSITIONS=682} [2022-11-02 20:43:22,281 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -55 predicate places. [2022-11-02 20:43:22,282 INFO L495 AbstractCegarLoop]: Abstraction has has 668 places, 682 transitions, 1650 flow [2022-11-02 20:43:22,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states 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:43:22,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:22,283 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:22,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:43:22,283 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:43:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash -383601548, now seen corresponding path program 1 times [2022-11-02 20:43:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:22,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75601908] [2022-11-02 20:43:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:43:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75601908] [2022-11-02 20:43:22,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75601908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:22,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:22,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453319566] [2022-11-02 20:43:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:22,383 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 787 [2022-11-02 20:43:22,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 682 transitions, 1650 flow. Second operand has 3 states, 3 states have (on average 750.0) internal successors, (2250), 3 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states 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:43:22,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:22,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 787 [2022-11-02 20:43:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:25,833 INFO L130 PetriNetUnfolder]: 607/11766 cut-off events. [2022-11-02 20:43:25,833 INFO L131 PetriNetUnfolder]: For 166/168 co-relation queries the response was YES. [2022-11-02 20:43:26,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13792 conditions, 11766 events. 607/11766 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 111839 event pairs, 92 based on Foata normal form. 0/10438 useless extension candidates. Maximal degree in co-relation 13581. Up to 305 conditions per place. [2022-11-02 20:43:26,054 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 20 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2022-11-02 20:43:26,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 682 transitions, 1695 flow [2022-11-02 20:43:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:43:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2267 transitions. [2022-11-02 20:43:26,057 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9601863617111394 [2022-11-02 20:43:26,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2267 transitions. [2022-11-02 20:43:26,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2267 transitions. [2022-11-02 20:43:26,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:26,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2267 transitions. [2022-11-02 20:43:26,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 755.6666666666666) internal successors, (2267), 3 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:43:26,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:43:26,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states 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:43:26,065 INFO L175 Difference]: Start difference. First operand has 668 places, 682 transitions, 1650 flow. Second operand 3 states and 2267 transitions. [2022-11-02 20:43:26,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 682 transitions, 1695 flow [2022-11-02 20:43:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 682 transitions, 1689 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:43:26,084 INFO L231 Difference]: Finished difference. Result has 667 places, 681 transitions, 1646 flow [2022-11-02 20:43:26,085 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=667, PETRI_TRANSITIONS=681} [2022-11-02 20:43:26,085 INFO L287 CegarLoopForPetriNet]: 723 programPoint places, -56 predicate places. [2022-11-02 20:43:26,085 INFO L495 AbstractCegarLoop]: Abstraction has has 667 places, 681 transitions, 1646 flow [2022-11-02 20:43:26,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.0) internal successors, (2250), 3 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states 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:43:26,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:26,087 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:26,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:43:26,087 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-02 20:43:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 933380390, now seen corresponding path program 1 times [2022-11-02 20:43:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:26,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470507026] [2022-11-02 20:43:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:43:26,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470507026] [2022-11-02 20:43:26,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470507026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:26,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:26,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:43:26,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098952049] [2022-11-02 20:43:26,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:26,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:26,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:26,998 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 727 out of 787 [2022-11-02 20:43:27,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 681 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 730.1666666666666) internal successors, (4381), 6 states have internal predecessors, (4381), 0 states have call successors, (0), 0 states 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:43:27,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:27,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 727 of 787 [2022-11-02 20:43:27,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand