./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:35:59,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:35:59,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:35:59,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:35:59,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:35:59,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:35:59,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:35:59,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:35:59,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:35:59,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:35:59,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:35:59,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:35:59,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:35:59,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:35:59,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:35:59,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:35:59,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:35:59,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:35:59,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:35:59,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:35:59,628 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:35:59,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:35:59,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:35:59,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:35:59,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:35:59,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:35:59,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:35:59,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:35:59,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:35:59,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:35:59,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:35:59,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:35:59,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:35:59,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:35:59,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:35:59,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:35:59,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:35:59,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:35:59,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:35:59,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:35:59,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:35:59,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:35:59,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 16:35:59,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:35:59,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:35:59,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:35:59,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:35:59,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:35:59,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:35:59,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:35:59,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:35:59,664 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:35:59,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:35:59,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:35:59,664 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:35:59,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:35:59,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:35:59,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:35:59,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:35:59,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:35:59,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:35:59,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:35:59,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:35:59,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:35:59,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:35:59,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:35:59,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:35:59,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:35:59,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:35:59,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:35:59,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:35:59,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:35:59,668 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 [2022-04-18 16:35:59,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:35:59,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:35:59,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:35:59,847 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:35:59,848 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:35:59,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-04-18 16:35:59,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f1f165a/e71a3caaaecd49ff98286791219eff84/FLAG9ca252db3 [2022-04-18 16:36:00,258 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:36:00,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-04-18 16:36:00,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f1f165a/e71a3caaaecd49ff98286791219eff84/FLAG9ca252db3 [2022-04-18 16:36:00,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f1f165a/e71a3caaaecd49ff98286791219eff84 [2022-04-18 16:36:00,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:36:00,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:36:00,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:00,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:36:00,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:36:00,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595db8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00, skipping insertion in model container [2022-04-18 16:36:00,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:36:00,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:36:00,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-04-18 16:36:00,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:00,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:36:00,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-04-18 16:36:00,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:00,525 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:36:00,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00 WrapperNode [2022-04-18 16:36:00,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:00,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:00,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:36:00,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:36:00,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,563 INFO L137 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2022-04-18 16:36:00,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:00,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:36:00,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:36:00,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:36:00,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:36:00,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:36:00,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:36:00,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:36:00,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (1/1) ... [2022-04-18 16:36:00,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:36:00,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:36:00,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 16:36:00,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 16:36:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:36:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:36:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:36:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:36:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:36:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:36:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:36:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:36:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 16:36:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 16:36:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:36:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 16:36:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:36:00,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:36:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:36:00,658 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 16:36:00,733 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:36:00,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:36:01,049 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:36:01,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:36:01,057 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-18 16:36:01,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:01 BoogieIcfgContainer [2022-04-18 16:36:01,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:36:01,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:36:01,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:36:01,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:36:01,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:36:00" (1/3) ... [2022-04-18 16:36:01,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d54a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:01, skipping insertion in model container [2022-04-18 16:36:01,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:00" (2/3) ... [2022-04-18 16:36:01,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d54a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:01, skipping insertion in model container [2022-04-18 16:36:01,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:01" (3/3) ... [2022-04-18 16:36:01,070 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-04-18 16:36:01,074 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:36:01,074 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:36:01,074 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-04-18 16:36:01,074 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:36:01,143 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 16:36:01,183 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:36:01,187 INFO L340 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 [2022-04-18 16:36:01,188 INFO L341 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-04-18 16:36:01,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 286 places, 289 transitions, 602 flow [2022-04-18 16:36:01,266 INFO L129 PetriNetUnfolder]: 13/286 cut-off events. [2022-04-18 16:36:01,267 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 16:36:01,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 286 events. 13/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2022-04-18 16:36:01,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 289 transitions, 602 flow [2022-04-18 16:36:01,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 266 transitions, 550 flow [2022-04-18 16:36:01,292 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2022-04-18 16:36:01,293 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:36:01,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:01,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:01,294 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash 444636234, now seen corresponding path program 1 times [2022-04-18 16:36:01,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097069601] [2022-04-18 16:36:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097069601] [2022-04-18 16:36:01,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097069601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:01,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:01,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660997240] [2022-04-18 16:36:01,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:01,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:01,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:01,503 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-04-18 16:36:01,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 266 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:01,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-04-18 16:36:01,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:01,659 INFO L129 PetriNetUnfolder]: 60/637 cut-off events. [2022-04-18 16:36:01,659 INFO L130 PetriNetUnfolder]: For 69/81 co-relation queries the response was YES. [2022-04-18 16:36:01,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 637 events. 60/637 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2992 event pairs, 39 based on Foata normal form. 34/534 useless extension candidates. Maximal degree in co-relation 568. Up to 99 conditions per place. [2022-04-18 16:36:01,669 INFO L132 encePairwiseOnDemand]: 279/289 looper letters, 21 selfloop transitions, 2 changer transitions 3/258 dead transitions. [2022-04-18 16:36:01,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 580 flow [2022-04-18 16:36:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2022-04-18 16:36:01,686 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2022-04-18 16:36:01,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2022-04-18 16:36:01,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2022-04-18 16:36:01,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:01,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2022-04-18 16:36:01,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,707 INFO L186 Difference]: Start difference. First operand has 264 places, 266 transitions, 550 flow. Second operand 3 states and 799 transitions. [2022-04-18 16:36:01,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 580 flow [2022-04-18 16:36:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-04-18 16:36:01,717 INFO L242 Difference]: Finished difference. Result has 259 places, 255 transitions, 520 flow [2022-04-18 16:36:01,718 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-04-18 16:36:01,721 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -5 predicate places. [2022-04-18 16:36:01,722 INFO L478 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 520 flow [2022-04-18 16:36:01,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:01,724 INFO L255 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] [2022-04-18 16:36:01,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:36:01,724 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1903590535, now seen corresponding path program 1 times [2022-04-18 16:36:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866309427] [2022-04-18 16:36:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:01,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866309427] [2022-04-18 16:36:01,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866309427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:01,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:01,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676002102] [2022-04-18 16:36:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:01,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:01,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:01,789 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-04-18 16:36:01,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:01,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-04-18 16:36:01,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:01,886 INFO L129 PetriNetUnfolder]: 36/538 cut-off events. [2022-04-18 16:36:01,887 INFO L130 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-04-18 16:36:01,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 538 events. 36/538 cut-off events. For 9/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2253 event pairs, 21 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 593. Up to 74 conditions per place. [2022-04-18 16:36:01,892 INFO L132 encePairwiseOnDemand]: 286/289 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2022-04-18 16:36:01,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 254 transitions, 564 flow [2022-04-18 16:36:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2022-04-18 16:36:01,895 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9134948096885813 [2022-04-18 16:36:01,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2022-04-18 16:36:01,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2022-04-18 16:36:01,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:01,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2022-04-18 16:36:01,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,899 INFO L186 Difference]: Start difference. First operand has 259 places, 255 transitions, 520 flow. Second operand 3 states and 792 transitions. [2022-04-18 16:36:01,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 254 transitions, 564 flow [2022-04-18 16:36:01,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:01,907 INFO L242 Difference]: Finished difference. Result has 255 places, 254 transitions, 518 flow [2022-04-18 16:36:01,908 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=255, PETRI_TRANSITIONS=254} [2022-04-18 16:36:01,908 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -9 predicate places. [2022-04-18 16:36:01,908 INFO L478 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 518 flow [2022-04-18 16:36:01,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,909 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:01,909 INFO L255 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] [2022-04-18 16:36:01,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:36:01,909 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1608973978, now seen corresponding path program 1 times [2022-04-18 16:36:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61313030] [2022-04-18 16:36:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:01,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61313030] [2022-04-18 16:36:01,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61313030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:01,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:01,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546076603] [2022-04-18 16:36:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:01,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:01,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:01,972 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-04-18 16:36:01,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:01,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-04-18 16:36:01,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:02,043 INFO L129 PetriNetUnfolder]: 25/487 cut-off events. [2022-04-18 16:36:02,043 INFO L130 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-04-18 16:36:02,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 487 events. 25/487 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1856 event pairs, 12 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 505. Up to 46 conditions per place. [2022-04-18 16:36:02,048 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/250 dead transitions. [2022-04-18 16:36:02,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 542 flow [2022-04-18 16:36:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-04-18 16:36:02,051 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-04-18 16:36:02,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-04-18 16:36:02,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-04-18 16:36:02,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:02,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-04-18 16:36:02,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,061 INFO L186 Difference]: Start difference. First operand has 255 places, 254 transitions, 518 flow. Second operand 3 states and 797 transitions. [2022-04-18 16:36:02,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 542 flow [2022-04-18 16:36:02,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:02,065 INFO L242 Difference]: Finished difference. Result has 251 places, 250 transitions, 508 flow [2022-04-18 16:36:02,065 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=251, PETRI_TRANSITIONS=250} [2022-04-18 16:36:02,067 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-04-18 16:36:02,067 INFO L478 AbstractCegarLoop]: Abstraction has has 251 places, 250 transitions, 508 flow [2022-04-18 16:36:02,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,068 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:02,068 INFO L255 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-04-18 16:36:02,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:36:02,068 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2112885161, now seen corresponding path program 1 times [2022-04-18 16:36:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:02,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693499634] [2022-04-18 16:36:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:02,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693499634] [2022-04-18 16:36:02,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693499634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:02,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:02,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042355523] [2022-04-18 16:36:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:02,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:02,153 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-04-18 16:36:02,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 250 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:02,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-04-18 16:36:02,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:02,348 INFO L129 PetriNetUnfolder]: 224/1619 cut-off events. [2022-04-18 16:36:02,348 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-04-18 16:36:02,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1619 events. 224/1619 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 12311 event pairs, 135 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1926. Up to 322 conditions per place. [2022-04-18 16:36:02,362 INFO L132 encePairwiseOnDemand]: 286/289 looper letters, 18 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-04-18 16:36:02,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 546 flow [2022-04-18 16:36:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2022-04-18 16:36:02,365 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9204152249134948 [2022-04-18 16:36:02,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2022-04-18 16:36:02,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2022-04-18 16:36:02,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:02,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2022-04-18 16:36:02,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,371 INFO L186 Difference]: Start difference. First operand has 251 places, 250 transitions, 508 flow. Second operand 3 states and 798 transitions. [2022-04-18 16:36:02,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 546 flow [2022-04-18 16:36:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:02,376 INFO L242 Difference]: Finished difference. Result has 251 places, 249 transitions, 509 flow [2022-04-18 16:36:02,376 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2022-04-18 16:36:02,377 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-04-18 16:36:02,378 INFO L478 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 509 flow [2022-04-18 16:36:02,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,378 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:02,378 INFO L255 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] [2022-04-18 16:36:02,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:36:02,379 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash 12063358, now seen corresponding path program 1 times [2022-04-18 16:36:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:02,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714977620] [2022-04-18 16:36:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:02,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:02,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714977620] [2022-04-18 16:36:02,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714977620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:02,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:02,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480777763] [2022-04-18 16:36:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:02,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:02,507 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 289 [2022-04-18 16:36:02,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:02,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 289 [2022-04-18 16:36:02,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,059 INFO L129 PetriNetUnfolder]: 7760/21752 cut-off events. [2022-04-18 16:36:05,059 INFO L130 PetriNetUnfolder]: For 90/1137 co-relation queries the response was YES. [2022-04-18 16:36:05,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32430 conditions, 21752 events. 7760/21752 cut-off events. For 90/1137 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 245646 event pairs, 6552 based on Foata normal form. 0/17184 useless extension candidates. Maximal degree in co-relation 32390. Up to 10611 conditions per place. [2022-04-18 16:36:05,251 INFO L132 encePairwiseOnDemand]: 283/289 looper letters, 53 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2022-04-18 16:36:05,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 623 flow [2022-04-18 16:36:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2022-04-18 16:36:05,255 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7987312572087658 [2022-04-18 16:36:05,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1385 transitions. [2022-04-18 16:36:05,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1385 transitions. [2022-04-18 16:36:05,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1385 transitions. [2022-04-18 16:36:05,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.83333333333334) internal successors, (1385), 6 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,263 INFO L186 Difference]: Start difference. First operand has 251 places, 249 transitions, 509 flow. Second operand 6 states and 1385 transitions. [2022-04-18 16:36:05,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 623 flow [2022-04-18 16:36:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:05,267 INFO L242 Difference]: Finished difference. Result has 253 places, 248 transitions, 513 flow [2022-04-18 16:36:05,267 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-04-18 16:36:05,269 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-04-18 16:36:05,270 INFO L478 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 513 flow [2022-04-18 16:36:05,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,271 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,271 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:05,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:36:05,272 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash 34551780, now seen corresponding path program 1 times [2022-04-18 16:36:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53118480] [2022-04-18 16:36:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:05,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53118480] [2022-04-18 16:36:05,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53118480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:05,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:05,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832402368] [2022-04-18 16:36:05,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:05,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:05,343 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-04-18 16:36:05,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:05,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-04-18 16:36:05,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,410 INFO L129 PetriNetUnfolder]: 37/520 cut-off events. [2022-04-18 16:36:05,411 INFO L130 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-04-18 16:36:05,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 520 events. 37/520 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2082 event pairs, 20 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 574. Up to 56 conditions per place. [2022-04-18 16:36:05,416 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2022-04-18 16:36:05,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 537 flow [2022-04-18 16:36:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-04-18 16:36:05,419 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-04-18 16:36:05,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-04-18 16:36:05,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-04-18 16:36:05,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-04-18 16:36:05,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,423 INFO L186 Difference]: Start difference. First operand has 253 places, 248 transitions, 513 flow. Second operand 3 states and 797 transitions. [2022-04-18 16:36:05,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 537 flow [2022-04-18 16:36:05,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 244 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:05,427 INFO L242 Difference]: Finished difference. Result has 246 places, 244 transitions, 497 flow [2022-04-18 16:36:05,428 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=246, PETRI_TRANSITIONS=244} [2022-04-18 16:36:05,430 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-04-18 16:36:05,430 INFO L478 AbstractCegarLoop]: Abstraction has has 246 places, 244 transitions, 497 flow [2022-04-18 16:36:05,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,431 INFO L255 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] [2022-04-18 16:36:05,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:36:05,431 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2117582322, now seen corresponding path program 1 times [2022-04-18 16:36:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161443835] [2022-04-18 16:36:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:05,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161443835] [2022-04-18 16:36:05,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161443835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:05,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:05,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933496469] [2022-04-18 16:36:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:05,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:05,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:05,483 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-04-18 16:36:05,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 244 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:05,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-04-18 16:36:05,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,520 INFO L129 PetriNetUnfolder]: 18/311 cut-off events. [2022-04-18 16:36:05,520 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-04-18 16:36:05,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 311 events. 18/311 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 861 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 325. Up to 23 conditions per place. [2022-04-18 16:36:05,523 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2022-04-18 16:36:05,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 244 transitions, 529 flow [2022-04-18 16:36:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-04-18 16:36:05,525 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-04-18 16:36:05,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,529 INFO L186 Difference]: Start difference. First operand has 246 places, 244 transitions, 497 flow. Second operand 3 states and 812 transitions. [2022-04-18 16:36:05,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 244 transitions, 529 flow [2022-04-18 16:36:05,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:05,532 INFO L242 Difference]: Finished difference. Result has 245 places, 242 transitions, 498 flow [2022-04-18 16:36:05,532 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2022-04-18 16:36:05,533 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-04-18 16:36:05,533 INFO L478 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 498 flow [2022-04-18 16:36:05,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,534 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,534 INFO L255 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] [2022-04-18 16:36:05,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:36:05,534 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -817865324, now seen corresponding path program 1 times [2022-04-18 16:36:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401473415] [2022-04-18 16:36:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:05,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401473415] [2022-04-18 16:36:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401473415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:05,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801044056] [2022-04-18 16:36:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:05,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:05,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:05,561 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2022-04-18 16:36:05,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:05,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2022-04-18 16:36:05,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,707 INFO L129 PetriNetUnfolder]: 114/1130 cut-off events. [2022-04-18 16:36:05,708 INFO L130 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-04-18 16:36:05,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 1130 events. 114/1130 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7472 event pairs, 29 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1290. Up to 161 conditions per place. [2022-04-18 16:36:05,715 INFO L132 encePairwiseOnDemand]: 283/289 looper letters, 19 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2022-04-18 16:36:05,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 247 transitions, 557 flow [2022-04-18 16:36:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-04-18 16:36:05,717 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-04-18 16:36:05,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-04-18 16:36:05,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-04-18 16:36:05,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-04-18 16:36:05,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,721 INFO L186 Difference]: Start difference. First operand has 245 places, 242 transitions, 498 flow. Second operand 3 states and 811 transitions. [2022-04-18 16:36:05,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 247 transitions, 557 flow [2022-04-18 16:36:05,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 247 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:05,724 INFO L242 Difference]: Finished difference. Result has 243 places, 242 transitions, 507 flow [2022-04-18 16:36:05,725 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=243, PETRI_TRANSITIONS=242} [2022-04-18 16:36:05,726 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-04-18 16:36:05,726 INFO L478 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 507 flow [2022-04-18 16:36:05,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,727 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,727 INFO L255 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] [2022-04-18 16:36:05,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:36:05,727 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1722324090, now seen corresponding path program 1 times [2022-04-18 16:36:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722901643] [2022-04-18 16:36:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722901643] [2022-04-18 16:36:05,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722901643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:05,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:05,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402949620] [2022-04-18 16:36:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:05,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:05,765 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-04-18 16:36:05,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 242 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:05,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-04-18 16:36:05,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([738] thread3EXIT-->L87-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][234], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 61#L87-7true, 314#(= |#race~M~0| 0), 325#true]) [2022-04-18 16:36:05,832 INFO L384 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-04-18 16:36:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-04-18 16:36:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:05,833 INFO L129 PetriNetUnfolder]: 69/585 cut-off events. [2022-04-18 16:36:05,834 INFO L130 PetriNetUnfolder]: For 35/43 co-relation queries the response was YES. [2022-04-18 16:36:05,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 585 events. 69/585 cut-off events. For 35/43 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2728 event pairs, 13 based on Foata normal form. 2/529 useless extension candidates. Maximal degree in co-relation 708. Up to 57 conditions per place. [2022-04-18 16:36:05,839 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2022-04-18 16:36:05,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 539 flow [2022-04-18 16:36:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-04-18 16:36:05,841 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-04-18 16:36:05,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-04-18 16:36:05,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,845 INFO L186 Difference]: Start difference. First operand has 243 places, 242 transitions, 507 flow. Second operand 3 states and 812 transitions. [2022-04-18 16:36:05,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 539 flow [2022-04-18 16:36:05,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:05,850 INFO L242 Difference]: Finished difference. Result has 243 places, 240 transitions, 509 flow [2022-04-18 16:36:05,850 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=243, PETRI_TRANSITIONS=240} [2022-04-18 16:36:05,852 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-04-18 16:36:05,852 INFO L478 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 509 flow [2022-04-18 16:36:05,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,853 INFO L255 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] [2022-04-18 16:36:05,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:36:05,853 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1072662552, now seen corresponding path program 1 times [2022-04-18 16:36:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128242686] [2022-04-18 16:36:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128242686] [2022-04-18 16:36:05,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128242686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:05,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:05,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 16:36:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98931058] [2022-04-18 16:36:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:05,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 16:36:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 16:36:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-18 16:36:05,940 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 289 [2022-04-18 16:36:05,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 240 transitions, 509 flow. Second operand has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:05,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:05,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 289 [2022-04-18 16:36:05,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:06,187 INFO L129 PetriNetUnfolder]: 256/1414 cut-off events. [2022-04-18 16:36:06,188 INFO L130 PetriNetUnfolder]: For 42/97 co-relation queries the response was YES. [2022-04-18 16:36:06,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1414 events. 256/1414 cut-off events. For 42/97 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9192 event pairs, 118 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1937. Up to 337 conditions per place. [2022-04-18 16:36:06,201 INFO L132 encePairwiseOnDemand]: 280/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/265 dead transitions. [2022-04-18 16:36:06,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 265 transitions, 697 flow [2022-04-18 16:36:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 16:36:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-04-18 16:36:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1978 transitions. [2022-04-18 16:36:06,205 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8555363321799307 [2022-04-18 16:36:06,205 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1978 transitions. [2022-04-18 16:36:06,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1978 transitions. [2022-04-18 16:36:06,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:06,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1978 transitions. [2022-04-18 16:36:06,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 247.25) internal successors, (1978), 8 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:06,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:06,213 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:06,213 INFO L186 Difference]: Start difference. First operand has 243 places, 240 transitions, 509 flow. Second operand 8 states and 1978 transitions. [2022-04-18 16:36:06,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 265 transitions, 697 flow [2022-04-18 16:36:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:06,217 INFO L242 Difference]: Finished difference. Result has 251 places, 243 transitions, 539 flow [2022-04-18 16:36:06,218 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=539, PETRI_PLACES=251, PETRI_TRANSITIONS=243} [2022-04-18 16:36:06,219 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-04-18 16:36:06,219 INFO L478 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 539 flow [2022-04-18 16:36:06,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:06,220 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:06,220 INFO L255 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] [2022-04-18 16:36:06,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:36:06,220 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash -371646906, now seen corresponding path program 1 times [2022-04-18 16:36:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:06,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31915296] [2022-04-18 16:36:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:06,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31915296] [2022-04-18 16:36:06,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31915296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:06,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:06,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161353570] [2022-04-18 16:36:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:06,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:06,309 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-04-18 16:36:06,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 243 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:06,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:06,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-04-18 16:36:06,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:07,948 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 25#L65-6true, 322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 178#L85-7true]) [2022-04-18 16:36:07,949 INFO L384 tUnfolder$Statistics]: this new event has 165 ancestors and is cut-off event [2022-04-18 16:36:07,949 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:07,949 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:36:07,950 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:08,111 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 132#L86-2true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,111 INFO L384 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,112 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,112 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,112 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,184 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 25#L65-6true, 322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 191#L86-3true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,184 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,185 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,185 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,185 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,243 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 163#L86-4true]) [2022-04-18 16:36:08,244 INFO L384 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,244 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,244 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,244 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:08,293 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 164#L86-5true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,293 INFO L384 tUnfolder$Statistics]: this new event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,294 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,294 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:08,294 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,336 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 32#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,337 INFO L384 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 25#L65-6true, 322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 243#L86-6true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,337 INFO L384 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][170], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 162#L65-3true, 314#(= |#race~M~0| 0), 348#true, 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,370 INFO L384 tUnfolder$Statistics]: this new event has 176 ancestors and is cut-off event [2022-04-18 16:36:08,370 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:08,370 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-04-18 16:36:08,370 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:08,401 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 178#L85-7true]) [2022-04-18 16:36:08,401 INFO L384 tUnfolder$Statistics]: this new event has 165 ancestors and is cut-off event [2022-04-18 16:36:08,402 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:08,402 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:08,402 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:36:08,402 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:08,487 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 25#L65-6true, 322#(= |#race~A~0| 0), 132#L86-2true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,487 INFO L384 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,488 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,488 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,488 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,488 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:08,516 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 191#L86-3true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,516 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,543 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 163#L86-4true]) [2022-04-18 16:36:08,543 INFO L384 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,544 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,544 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,544 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:08,544 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:08,569 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 164#L86-5true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,569 INFO L384 tUnfolder$Statistics]: this new event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,569 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,569 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,569 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:08,569 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:08,587 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 32#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,587 INFO L384 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,587 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, 299#(= |#race~N~0| 0), Black: 320#true, 181#L57-3true, 314#(= |#race~M~0| 0), 243#L86-6true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,588 INFO L384 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,588 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,720 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 54#L86-7true]) [2022-04-18 16:36:08,720 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-04-18 16:36:08,720 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,720 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [5#L87-2true, 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,721 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 160#L87-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,721 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:08,721 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [353#(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)), 337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 25#L65-6true, 322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 169#L87-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,722 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 204#L87-5true]) [2022-04-18 16:36:08,722 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 20#L87-6true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:08,722 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:08,722 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:08,723 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][183], [337#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 353#(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)), 322#(= |#race~A~0| 0), 25#L65-6true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 174#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue]) [2022-04-18 16:36:08,723 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-04-18 16:36:08,723 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:08,723 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:08,723 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:08,723 INFO L129 PetriNetUnfolder]: 11012/22773 cut-off events. [2022-04-18 16:36:08,723 INFO L130 PetriNetUnfolder]: For 53/1570 co-relation queries the response was YES. [2022-04-18 16:36:08,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38866 conditions, 22773 events. 11012/22773 cut-off events. For 53/1570 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 211662 event pairs, 2234 based on Foata normal form. 60/19509 useless extension candidates. Maximal degree in co-relation 38818. Up to 6490 conditions per place. [2022-04-18 16:36:08,879 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 118 selfloop transitions, 4 changer transitions 0/314 dead transitions. [2022-04-18 16:36:08,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 314 transitions, 925 flow [2022-04-18 16:36:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1479 transitions. [2022-04-18 16:36:08,882 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2022-04-18 16:36:08,882 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1479 transitions. [2022-04-18 16:36:08,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1479 transitions. [2022-04-18 16:36:08,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:08,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1479 transitions. [2022-04-18 16:36:08,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,887 INFO L186 Difference]: Start difference. First operand has 251 places, 243 transitions, 539 flow. Second operand 6 states and 1479 transitions. [2022-04-18 16:36:08,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 314 transitions, 925 flow [2022-04-18 16:36:08,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 314 transitions, 915 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:08,901 INFO L242 Difference]: Finished difference. Result has 251 places, 242 transitions, 535 flow [2022-04-18 16:36:08,902 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=251, PETRI_TRANSITIONS=242} [2022-04-18 16:36:08,902 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-04-18 16:36:08,902 INFO L478 AbstractCegarLoop]: Abstraction has has 251 places, 242 transitions, 535 flow [2022-04-18 16:36:08,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,912 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:08,913 INFO L255 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] [2022-04-18 16:36:08,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:36:08,913 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1108507916, now seen corresponding path program 1 times [2022-04-18 16:36:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:08,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395311646] [2022-04-18 16:36:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395311646] [2022-04-18 16:36:08,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395311646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:08,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:08,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378823625] [2022-04-18 16:36:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:08,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:08,941 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-04-18 16:36:08,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 242 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:08,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-04-18 16:36:08,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:09,031 INFO L129 PetriNetUnfolder]: 110/979 cut-off events. [2022-04-18 16:36:09,031 INFO L130 PetriNetUnfolder]: For 84/97 co-relation queries the response was YES. [2022-04-18 16:36:09,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 979 events. 110/979 cut-off events. For 84/97 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5771 event pairs, 17 based on Foata normal form. 6/891 useless extension candidates. Maximal degree in co-relation 1193. Up to 86 conditions per place. [2022-04-18 16:36:09,039 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 10 selfloop transitions, 2 changer transitions 7/242 dead transitions. [2022-04-18 16:36:09,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 242 transitions, 565 flow [2022-04-18 16:36:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-04-18 16:36:09,040 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-04-18 16:36:09,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-04-18 16:36:09,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-04-18 16:36:09,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:09,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-04-18 16:36:09,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,044 INFO L186 Difference]: Start difference. First operand has 251 places, 242 transitions, 535 flow. Second operand 3 states and 811 transitions. [2022-04-18 16:36:09,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 242 transitions, 565 flow [2022-04-18 16:36:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 558 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:09,047 INFO L242 Difference]: Finished difference. Result has 247 places, 233 transitions, 513 flow [2022-04-18 16:36:09,048 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=247, PETRI_TRANSITIONS=233} [2022-04-18 16:36:09,049 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -17 predicate places. [2022-04-18 16:36:09,049 INFO L478 AbstractCegarLoop]: Abstraction has has 247 places, 233 transitions, 513 flow [2022-04-18 16:36:09,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,049 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:09,050 INFO L255 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] [2022-04-18 16:36:09,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:36:09,050 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2099288416, now seen corresponding path program 1 times [2022-04-18 16:36:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:09,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174513981] [2022-04-18 16:36:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:09,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174513981] [2022-04-18 16:36:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174513981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:09,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:09,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:09,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038389598] [2022-04-18 16:36:09,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:09,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 16:36:09,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 16:36:09,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-18 16:36:09,101 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 289 [2022-04-18 16:36:09,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 233 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:09,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 289 [2022-04-18 16:36:09,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:09,274 INFO L129 PetriNetUnfolder]: 291/2045 cut-off events. [2022-04-18 16:36:09,274 INFO L130 PetriNetUnfolder]: For 138/180 co-relation queries the response was YES. [2022-04-18 16:36:09,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 2045 events. 291/2045 cut-off events. For 138/180 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 16872 event pairs, 161 based on Foata normal form. 3/1803 useless extension candidates. Maximal degree in co-relation 2704. Up to 373 conditions per place. [2022-04-18 16:36:09,289 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 36 selfloop transitions, 4 changer transitions 0/246 dead transitions. [2022-04-18 16:36:09,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 626 flow [2022-04-18 16:36:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 16:36:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-04-18 16:36:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1301 transitions. [2022-04-18 16:36:09,292 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9003460207612457 [2022-04-18 16:36:09,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1301 transitions. [2022-04-18 16:36:09,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1301 transitions. [2022-04-18 16:36:09,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:09,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1301 transitions. [2022-04-18 16:36:09,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 260.2) internal successors, (1301), 5 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,296 INFO L186 Difference]: Start difference. First operand has 247 places, 233 transitions, 513 flow. Second operand 5 states and 1301 transitions. [2022-04-18 16:36:09,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 246 transitions, 626 flow [2022-04-18 16:36:09,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 246 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:09,300 INFO L242 Difference]: Finished difference. Result has 244 places, 234 transitions, 526 flow [2022-04-18 16:36:09,300 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=526, PETRI_PLACES=244, PETRI_TRANSITIONS=234} [2022-04-18 16:36:09,300 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -20 predicate places. [2022-04-18 16:36:09,301 INFO L478 AbstractCegarLoop]: Abstraction has has 244 places, 234 transitions, 526 flow [2022-04-18 16:36:09,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,301 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:09,301 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:09,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:36:09,302 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1095931425, now seen corresponding path program 1 times [2022-04-18 16:36:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:09,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086336623] [2022-04-18 16:36:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:09,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086336623] [2022-04-18 16:36:09,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086336623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:09,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:09,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130436059] [2022-04-18 16:36:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:09,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:09,374 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-04-18 16:36:09,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 234 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:09,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:09,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-04-18 16:36:09,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:14,317 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [322#(= |#race~A~0| 0), Black: 320#true, 37#L49-3true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,317 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:14,317 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:14,317 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:14,317 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:14,542 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [139#L85-2true, 322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,542 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-04-18 16:36:14,542 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:14,542 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-04-18 16:36:14,542 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:14,588 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 351#(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)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,588 INFO L384 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-04-18 16:36:14,588 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:14,588 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:14,589 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:14,623 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [322#(= |#race~A~0| 0), 37#L49-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, 352#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,623 INFO L384 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-04-18 16:36:14,623 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:14,627 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:14,627 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:14,660 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L85-5true]) [2022-04-18 16:36:14,660 INFO L384 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-04-18 16:36:14,660 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:14,660 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:14,660 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:14,689 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][180], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 10#L85-6true, 353#(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)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,689 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-04-18 16:36:14,689 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:14,690 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:14,690 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:14,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 191#L86-3true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 183#L56-8true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,958 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 191#L86-3true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 271#L57true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,958 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 183#L56-8true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 163#L86-4true]) [2022-04-18 16:36:14,958 INFO L384 tUnfolder$Statistics]: this new event has 193 ancestors and is cut-off event [2022-04-18 16:36:14,958 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 271#L57true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, 163#L86-4true]) [2022-04-18 16:36:14,959 INFO L384 tUnfolder$Statistics]: this new event has 193 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 164#L86-5true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 183#L56-8true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,959 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:14,959 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 164#L86-5true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 271#L57true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,960 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 32#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 183#L56-8true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,960 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,960 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 243#L86-6true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 183#L56-8true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,961 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 32#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 271#L57true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,961 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,961 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 243#L86-6true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 271#L57true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,962 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), 54#L86-7true, Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,962 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:14,962 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:14,963 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:14,963 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 5#L87-2true, 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,963 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-04-18 16:36:14,963 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:14,963 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:14,963 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 160#L87-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,964 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 169#L87-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,964 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:14,964 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:14,965 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:14,965 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 204#L87-5true]) [2022-04-18 16:36:14,965 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-04-18 16:36:14,965 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:14,965 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:14,965 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 20#L87-6true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,966 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][170], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 359#true, 174#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:14,966 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:14,966 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:14,967 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:14,967 INFO L129 PetriNetUnfolder]: 24398/59733 cut-off events. [2022-04-18 16:36:14,967 INFO L130 PetriNetUnfolder]: For 3737/3737 co-relation queries the response was YES. [2022-04-18 16:36:15,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99732 conditions, 59733 events. 24398/59733 cut-off events. For 3737/3737 co-relation queries the response was YES. Maximal size of possible extension queue 1789. Compared 718893 event pairs, 12664 based on Foata normal form. 0/54040 useless extension candidates. Maximal degree in co-relation 99685. Up to 20759 conditions per place. [2022-04-18 16:36:15,447 INFO L132 encePairwiseOnDemand]: 283/289 looper letters, 158 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2022-04-18 16:36:15,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 341 transitions, 1078 flow [2022-04-18 16:36:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2022-04-18 16:36:15,451 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8621683967704729 [2022-04-18 16:36:15,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1495 transitions. [2022-04-18 16:36:15,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1495 transitions. [2022-04-18 16:36:15,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:15,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1495 transitions. [2022-04-18 16:36:15,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:15,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:15,458 INFO L186 Difference]: Start difference. First operand has 244 places, 234 transitions, 526 flow. Second operand 6 states and 1495 transitions. [2022-04-18 16:36:15,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 341 transitions, 1078 flow [2022-04-18 16:36:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 341 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:15,466 INFO L242 Difference]: Finished difference. Result has 246 places, 233 transitions, 529 flow [2022-04-18 16:36:15,467 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=246, PETRI_TRANSITIONS=233} [2022-04-18 16:36:15,467 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-04-18 16:36:15,468 INFO L478 AbstractCegarLoop]: Abstraction has has 246 places, 233 transitions, 529 flow [2022-04-18 16:36:15,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:15,468 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:15,468 INFO L255 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] [2022-04-18 16:36:15,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:36:15,468 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1828133762, now seen corresponding path program 1 times [2022-04-18 16:36:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:15,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248743077] [2022-04-18 16:36:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 16:36:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:15,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248743077] [2022-04-18 16:36:15,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248743077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:15,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:15,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105447322] [2022-04-18 16:36:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:15,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:15,551 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-04-18 16:36:15,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 233 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:15,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:15,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-04-18 16:36:15,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:19,998 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:19,998 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:19,999 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:20,001 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:20,001 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:20,036 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [139#L85-2true, 322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,036 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-04-18 16:36:20,036 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-04-18 16:36:20,036 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:20,036 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-04-18 16:36:20,045 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, 351#(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)), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,045 INFO L384 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-04-18 16:36:20,045 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:20,045 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-04-18 16:36:20,046 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:20,052 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 37#L49-3true, 162#L65-3true, 314#(= |#race~M~0| 0), 352#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,052 INFO L384 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-04-18 16:36:20,052 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:20,052 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:20,052 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-04-18 16:36:20,057 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L85-5true, 374#true]) [2022-04-18 16:36:20,057 INFO L384 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-04-18 16:36:20,057 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:20,057 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-04-18 16:36:20,057 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:20,060 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 37#L49-3true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 10#L85-6true, 353#(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)), 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,060 INFO L384 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-04-18 16:36:20,060 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:20,060 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:20,060 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-04-18 16:36:20,065 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), 54#L86-7true, Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,065 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-04-18 16:36:20,065 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:20,065 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:20,065 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 5#L87-2true, 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,066 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 160#L87-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,066 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 169#L87-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,066 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:20,066 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true, 204#L87-5true]) [2022-04-18 16:36:20,067 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 20#L87-6true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,067 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L65-4-->L65-5: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_15) (+ v_~A~0.offset_15 (* v_thread3Thread1of1ForFork1_~i~2_7 4))) |v_thread3Thread1of1ForFork1_#t~mem8_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_15, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_7, ~A~0.offset=v_~A~0.offset_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~mem8][166], [322#(= |#race~A~0| 0), 170#L65-5true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), 174#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:20,067 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:20,067 INFO L129 PetriNetUnfolder]: 20077/49526 cut-off events. [2022-04-18 16:36:20,067 INFO L130 PetriNetUnfolder]: For 5861/6186 co-relation queries the response was YES. [2022-04-18 16:36:20,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86333 conditions, 49526 events. 20077/49526 cut-off events. For 5861/6186 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 570948 event pairs, 11644 based on Foata normal form. 0/45429 useless extension candidates. Maximal degree in co-relation 86286. Up to 18043 conditions per place. [2022-04-18 16:36:20,620 INFO L132 encePairwiseOnDemand]: 283/289 looper letters, 129 selfloop transitions, 5 changer transitions 0/312 dead transitions. [2022-04-18 16:36:20,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 312 transitions, 999 flow [2022-04-18 16:36:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1466 transitions. [2022-04-18 16:36:20,624 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.845444059976932 [2022-04-18 16:36:20,624 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1466 transitions. [2022-04-18 16:36:20,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1466 transitions. [2022-04-18 16:36:20,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:20,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1466 transitions. [2022-04-18 16:36:20,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:20,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:20,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:20,629 INFO L186 Difference]: Start difference. First operand has 246 places, 233 transitions, 529 flow. Second operand 6 states and 1466 transitions. [2022-04-18 16:36:20,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 312 transitions, 999 flow [2022-04-18 16:36:20,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 312 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:20,640 INFO L242 Difference]: Finished difference. Result has 245 places, 232 transitions, 527 flow [2022-04-18 16:36:20,640 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=232} [2022-04-18 16:36:20,641 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-04-18 16:36:20,641 INFO L478 AbstractCegarLoop]: Abstraction has has 245 places, 232 transitions, 527 flow [2022-04-18 16:36:20,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:20,641 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:20,641 INFO L255 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] [2022-04-18 16:36:20,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:36:20,642 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 635641522, now seen corresponding path program 1 times [2022-04-18 16:36:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:20,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522573681] [2022-04-18 16:36:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:20,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522573681] [2022-04-18 16:36:20,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522573681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:20,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:20,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243261004] [2022-04-18 16:36:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:20,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:20,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:20,718 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-04-18 16:36:20,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 232 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:20,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:20,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-04-18 16:36:20,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:22,936 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [322#(= |#race~A~0| 0), 205#L83-4true, Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 381#true, 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 374#true]) [2022-04-18 16:36:22,936 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-04-18 16:36:22,936 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:22,936 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:22,937 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 16:36:24,852 INFO L129 PetriNetUnfolder]: 16666/41119 cut-off events. [2022-04-18 16:36:24,852 INFO L130 PetriNetUnfolder]: For 2188/2302 co-relation queries the response was YES. [2022-04-18 16:36:25,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70595 conditions, 41119 events. 16666/41119 cut-off events. For 2188/2302 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 470619 event pairs, 7742 based on Foata normal form. 0/38319 useless extension candidates. Maximal degree in co-relation 70548. Up to 12414 conditions per place. [2022-04-18 16:36:25,186 INFO L132 encePairwiseOnDemand]: 283/289 looper letters, 171 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2022-04-18 16:36:25,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 355 transitions, 1169 flow [2022-04-18 16:36:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1509 transitions. [2022-04-18 16:36:25,190 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.870242214532872 [2022-04-18 16:36:25,190 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1509 transitions. [2022-04-18 16:36:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1509 transitions. [2022-04-18 16:36:25,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:25,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1509 transitions. [2022-04-18 16:36:25,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,195 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,196 INFO L186 Difference]: Start difference. First operand has 245 places, 232 transitions, 527 flow. Second operand 6 states and 1509 transitions. [2022-04-18 16:36:25,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 355 transitions, 1169 flow [2022-04-18 16:36:25,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 355 transitions, 1127 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:25,218 INFO L242 Difference]: Finished difference. Result has 244 places, 231 transitions, 525 flow [2022-04-18 16:36:25,219 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=244, PETRI_TRANSITIONS=231} [2022-04-18 16:36:25,219 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -20 predicate places. [2022-04-18 16:36:25,219 INFO L478 AbstractCegarLoop]: Abstraction has has 244 places, 231 transitions, 525 flow [2022-04-18 16:36:25,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:25,221 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:25,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:36:25,222 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1969701154, now seen corresponding path program 1 times [2022-04-18 16:36:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295302731] [2022-04-18 16:36:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:25,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295302731] [2022-04-18 16:36:25,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295302731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:25,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:25,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208117367] [2022-04-18 16:36:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:25,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:25,253 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-04-18 16:36:25,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 231 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:25,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-04-18 16:36:25,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:25,375 INFO L129 PetriNetUnfolder]: 92/1142 cut-off events. [2022-04-18 16:36:25,376 INFO L130 PetriNetUnfolder]: For 51/63 co-relation queries the response was YES. [2022-04-18 16:36:25,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1142 events. 92/1142 cut-off events. For 51/63 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7095 event pairs, 28 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1430. Up to 104 conditions per place. [2022-04-18 16:36:25,385 INFO L132 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2022-04-18 16:36:25,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 232 transitions, 555 flow [2022-04-18 16:36:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-04-18 16:36:25,388 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-04-18 16:36:25,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:25,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,391 INFO L186 Difference]: Start difference. First operand has 244 places, 231 transitions, 525 flow. Second operand 3 states and 803 transitions. [2022-04-18 16:36:25,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 232 transitions, 555 flow [2022-04-18 16:36:25,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 232 transitions, 545 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:25,395 INFO L242 Difference]: Finished difference. Result has 240 places, 230 transitions, 517 flow [2022-04-18 16:36:25,395 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=240, PETRI_TRANSITIONS=230} [2022-04-18 16:36:25,395 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-04-18 16:36:25,396 INFO L478 AbstractCegarLoop]: Abstraction has has 240 places, 230 transitions, 517 flow [2022-04-18 16:36:25,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,396 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:25,396 INFO L255 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] [2022-04-18 16:36:25,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 16:36:25,396 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1638244027, now seen corresponding path program 1 times [2022-04-18 16:36:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:25,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158827427] [2022-04-18 16:36:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 16:36:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:25,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158827427] [2022-04-18 16:36:25,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158827427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:25,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:25,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901494844] [2022-04-18 16:36:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:25,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:25,427 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-04-18 16:36:25,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 230 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:25,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-04-18 16:36:25,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:25,541 INFO L129 PetriNetUnfolder]: 76/1063 cut-off events. [2022-04-18 16:36:25,541 INFO L130 PetriNetUnfolder]: For 22/38 co-relation queries the response was YES. [2022-04-18 16:36:25,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1063 events. 76/1063 cut-off events. For 22/38 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6307 event pairs, 29 based on Foata normal form. 1/1018 useless extension candidates. Maximal degree in co-relation 1322. Up to 107 conditions per place. [2022-04-18 16:36:25,550 INFO L132 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-04-18 16:36:25,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 231 transitions, 547 flow [2022-04-18 16:36:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-04-18 16:36:25,552 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-04-18 16:36:25,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:25,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,556 INFO L186 Difference]: Start difference. First operand has 240 places, 230 transitions, 517 flow. Second operand 3 states and 803 transitions. [2022-04-18 16:36:25,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 231 transitions, 547 flow [2022-04-18 16:36:25,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 231 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:25,559 INFO L242 Difference]: Finished difference. Result has 239 places, 229 transitions, 515 flow [2022-04-18 16:36:25,560 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=239, PETRI_TRANSITIONS=229} [2022-04-18 16:36:25,560 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -25 predicate places. [2022-04-18 16:36:25,560 INFO L478 AbstractCegarLoop]: Abstraction has has 239 places, 229 transitions, 515 flow [2022-04-18 16:36:25,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,561 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:25,561 INFO L255 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] [2022-04-18 16:36:25,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-18 16:36:25,561 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 777045301, now seen corresponding path program 1 times [2022-04-18 16:36:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358066539] [2022-04-18 16:36:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:25,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358066539] [2022-04-18 16:36:25,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358066539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:25,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:25,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184622666] [2022-04-18 16:36:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:25,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:25,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:25,591 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-04-18 16:36:25,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 229 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:25,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-04-18 16:36:25,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:25,818 INFO L129 PetriNetUnfolder]: 168/1262 cut-off events. [2022-04-18 16:36:25,818 INFO L130 PetriNetUnfolder]: For 137/150 co-relation queries the response was YES. [2022-04-18 16:36:25,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1693 conditions, 1262 events. 168/1262 cut-off events. For 137/150 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8659 event pairs, 57 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1647. Up to 218 conditions per place. [2022-04-18 16:36:25,825 INFO L132 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-04-18 16:36:25,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 230 transitions, 545 flow [2022-04-18 16:36:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-04-18 16:36:25,827 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-04-18 16:36:25,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:25,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-04-18 16:36:25,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,830 INFO L186 Difference]: Start difference. First operand has 239 places, 229 transitions, 515 flow. Second operand 3 states and 803 transitions. [2022-04-18 16:36:25,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 230 transitions, 545 flow [2022-04-18 16:36:25,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:25,833 INFO L242 Difference]: Finished difference. Result has 238 places, 228 transitions, 513 flow [2022-04-18 16:36:25,833 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=238, PETRI_TRANSITIONS=228} [2022-04-18 16:36:25,833 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -26 predicate places. [2022-04-18 16:36:25,833 INFO L478 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 513 flow [2022-04-18 16:36:25,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:25,834 INFO L255 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] [2022-04-18 16:36:25,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-18 16:36:25,834 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 105451219, now seen corresponding path program 1 times [2022-04-18 16:36:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:25,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545991505] [2022-04-18 16:36:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545991505] [2022-04-18 16:36:25,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545991505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:25,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:25,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142271836] [2022-04-18 16:36:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:25,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:25,905 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-04-18 16:36:25,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 228 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:25,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-04-18 16:36:25,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:26,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), 205#L83-4true, Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 396#true, 400#true, 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:26,966 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-04-18 16:36:26,966 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:26,966 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 16:36:26,966 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:27,747 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][177], [322#(= |#race~A~0| 0), Black: 320#true, 37#L49-3true, 299#(= |#race~N~0| 0), 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 400#true, 396#true, 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:27,747 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,747 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:27,747 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,747 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([643] L49-2-->L49-3: Formula: (= |v_#race~A~0_1| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_1|} AuxVars[] AssignedVars[#race~A~0][206], [322#(= |#race~A~0| 0), 37#L49-3true, Black: 320#true, 299#(= |#race~N~0| 0), 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 400#true, 396#true, 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:27,788 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,788 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,788 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,788 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:28,238 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), 54#L86-7true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,239 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 5#L87-2true, 353#(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#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,239 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:28,239 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, 160#L87-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,240 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, 169#L87-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,240 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:28,240 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 204#L87-5true]) [2022-04-18 16:36:28,241 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 20#L87-6true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,241 INFO L384 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][212], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), 174#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:28,241 INFO L384 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-04-18 16:36:28,241 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:28,242 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-04-18 16:36:28,242 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-04-18 16:36:28,242 INFO L129 PetriNetUnfolder]: 7274/25334 cut-off events. [2022-04-18 16:36:28,242 INFO L130 PetriNetUnfolder]: For 151/355 co-relation queries the response was YES. [2022-04-18 16:36:28,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37940 conditions, 25334 events. 7274/25334 cut-off events. For 151/355 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 315107 event pairs, 5049 based on Foata normal form. 24/24352 useless extension candidates. Maximal degree in co-relation 37892. Up to 8024 conditions per place. [2022-04-18 16:36:28,449 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 80 selfloop transitions, 4 changer transitions 1/267 dead transitions. [2022-04-18 16:36:28,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 267 transitions, 761 flow [2022-04-18 16:36:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1442 transitions. [2022-04-18 16:36:28,452 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.831603229527105 [2022-04-18 16:36:28,452 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1442 transitions. [2022-04-18 16:36:28,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1442 transitions. [2022-04-18 16:36:28,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:28,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1442 transitions. [2022-04-18 16:36:28,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.33333333333334) internal successors, (1442), 6 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,457 INFO L186 Difference]: Start difference. First operand has 238 places, 228 transitions, 513 flow. Second operand 6 states and 1442 transitions. [2022-04-18 16:36:28,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 267 transitions, 761 flow [2022-04-18 16:36:28,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 267 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:28,492 INFO L242 Difference]: Finished difference. Result has 240 places, 226 transitions, 513 flow [2022-04-18 16:36:28,492 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=240, PETRI_TRANSITIONS=226} [2022-04-18 16:36:28,492 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-04-18 16:36:28,492 INFO L478 AbstractCegarLoop]: Abstraction has has 240 places, 226 transitions, 513 flow [2022-04-18 16:36:28,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,493 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:28,493 INFO L255 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] [2022-04-18 16:36:28,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-18 16:36:28,493 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-04-18 16:36:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1098149610, now seen corresponding path program 1 times [2022-04-18 16:36:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287705688] [2022-04-18 16:36:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:28,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287705688] [2022-04-18 16:36:28,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287705688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:28,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:28,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100201671] [2022-04-18 16:36:28,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:28,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:28,585 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-04-18 16:36:28,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 226 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:28,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-04-18 16:36:28,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:29,468 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), 205#L83-4true, 299#(= |#race~N~0| 0), Black: 320#true, 37#L49-3true, 407#true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 400#true, 181#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:29,468 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-04-18 16:36:29,468 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:29,468 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-04-18 16:36:29,468 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:30,453 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][177], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 407#true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 400#true, 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,453 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:30,453 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:30,453 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:30,453 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:30,506 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([643] L49-2-->L49-3: Formula: (= |v_#race~A~0_1| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_1|} AuxVars[] AssignedVars[#race~A~0][204], [322#(= |#race~A~0| 0), 37#L49-3true, Black: 320#true, 299#(= |#race~N~0| 0), 407#true, 162#L65-3true, 314#(= |#race~M~0| 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 400#true, 181#L57-3true, 199#L84-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,507 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:30,507 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:30,507 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:30,507 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][170], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 407#true, 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), 54#L86-7true, Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,951 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][170], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 407#true, 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 146#L87-1true, 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,951 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-04-18 16:36:30,951 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][222], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 5#L87-2true, 353#(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: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 409#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)]) [2022-04-18 16:36:30,952 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][224], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), 410#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 160#L87-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,952 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-04-18 16:36:30,952 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][226], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 169#L87-4true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-04-18 16:36:30,953 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][228], [322#(= |#race~A~0| 0), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 405#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 383#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 362#(<= (+ ~M~0 1) 0), Black: 363#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 353#(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)), 412#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 204#L87-5true]) [2022-04-18 16:36:30,953 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-04-18 16:36:30,953 INFO L129 PetriNetUnfolder]: 7159/25315 cut-off events. [2022-04-18 16:36:30,953 INFO L130 PetriNetUnfolder]: For 334/502 co-relation queries the response was YES. [2022-04-18 16:36:31,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37385 conditions, 25315 events. 7159/25315 cut-off events. For 334/502 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 316533 event pairs, 5734 based on Foata normal form. 28/24325 useless extension candidates. Maximal degree in co-relation 37337. Up to 9336 conditions per place. [2022-04-18 16:36:31,121 INFO L132 encePairwiseOnDemand]: 284/289 looper letters, 0 selfloop transitions, 0 changer transitions 245/245 dead transitions. [2022-04-18 16:36:31,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 245 transitions, 677 flow [2022-04-18 16:36:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1420 transitions. [2022-04-18 16:36:31,124 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8189158016147635 [2022-04-18 16:36:31,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1420 transitions. [2022-04-18 16:36:31,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1420 transitions. [2022-04-18 16:36:31,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:31,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1420 transitions. [2022-04-18 16:36:31,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.66666666666666) internal successors, (1420), 6 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:31,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:31,128 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:31,128 INFO L186 Difference]: Start difference. First operand has 240 places, 226 transitions, 513 flow. Second operand 6 states and 1420 transitions. [2022-04-18 16:36:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 245 transitions, 677 flow [2022-04-18 16:36:31,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 245 transitions, 670 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:31,137 INFO L242 Difference]: Finished difference. Result has 239 places, 0 transitions, 0 flow [2022-04-18 16:36:31,137 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=239, PETRI_TRANSITIONS=0} [2022-04-18 16:36:31,138 INFO L335 CegarLoopForPetriNet]: 264 programPoint places, -25 predicate places. [2022-04-18 16:36:31,138 INFO L478 AbstractCegarLoop]: Abstraction has has 239 places, 0 transitions, 0 flow [2022-04-18 16:36:31,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:31,140 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2022-04-18 16:36:31,140 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2022-04-18 16:36:31,140 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2022-04-18 16:36:31,140 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2022-04-18 16:36:31,141 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2022-04-18 16:36:31,142 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2022-04-18 16:36:31,143 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2022-04-18 16:36:31,144 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2022-04-18 16:36:31,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2022-04-18 16:36:31,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2022-04-18 16:36:31,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2022-04-18 16:36:31,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2022-04-18 16:36:31,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2022-04-18 16:36:31,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2022-04-18 16:36:31,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-18 16:36:31,149 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:31,152 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 16:36:31,152 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 16:36:31,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:36:31 BasicIcfg [2022-04-18 16:36:31,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 16:36:31,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 16:36:31,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 16:36:31,154 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 16:36:31,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:01" (3/4) ... [2022-04-18 16:36:31,156 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-04-18 16:36:31,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-04-18 16:36:31,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-04-18 16:36:31,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-04-18 16:36:31,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-04-18 16:36:31,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-04-18 16:36:31,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-04-18 16:36:31,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-04-18 16:36:31,188 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-04-18 16:36:31,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 16:36:31,189 INFO L158 Benchmark]: Toolchain (without parser) took 30910.58ms. Allocated memory was 96.5MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 63.5MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2022-04-18 16:36:31,189 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 16:36:31,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.63ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 63.2MB in the beginning and 103.7MB in the end (delta: -40.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 16:36:31,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 130.0MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 16:36:31,189 INFO L158 Benchmark]: Boogie Preprocessor took 31.77ms. Allocated memory is still 130.0MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:36:31,190 INFO L158 Benchmark]: RCFGBuilder took 462.54ms. Allocated memory is still 130.0MB. Free memory was 99.5MB in the beginning and 77.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-04-18 16:36:31,190 INFO L158 Benchmark]: TraceAbstraction took 30093.86ms. Allocated memory was 130.0MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 77.1MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2022-04-18 16:36:31,190 INFO L158 Benchmark]: Witness Printer took 34.09ms. Allocated memory is still 11.4GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:36:31,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.63ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 63.2MB in the beginning and 103.7MB in the end (delta: -40.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 130.0MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.77ms. Allocated memory is still 130.0MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 462.54ms. Allocated memory is still 130.0MB. Free memory was 99.5MB in the beginning and 77.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30093.86ms. Allocated memory was 130.0MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 77.1MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 34.09ms. Allocated memory is still 11.4GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 376 locations, 49 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2016 IncrementalHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 396 mSDtfsCounter, 2016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1900 NumberOfCodeBlocks, 1900 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 2820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-18 16:36:31,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE