./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i -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 dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 03:00:16,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:00:16,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:00:16,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:00:16,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:00:16,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:00:16,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:00:16,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:00:16,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:00:16,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:00:16,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:00:16,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:00:16,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:00:16,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:00:16,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:00:16,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:00:16,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:00:16,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:00:16,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:00:16,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:00:16,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:00:16,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:00:16,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:00:16,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:00:16,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:00:16,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:00:16,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:00:16,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:00:16,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:00:16,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:00:16,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:00:16,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:00:16,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:00:16,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:00:16,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:00:16,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:00:16,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:00:16,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:00:16,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:00:16,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:00:16,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:00:16,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 03:00:16,992 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:00:16,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:00:16,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:00:16,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:00:16,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:00:16,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:00:16,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:00:16,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:00:16,996 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:00:16,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:00:16,997 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:00:16,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:00:16,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:00:16,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:00:16,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:00:16,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:00:16,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:00:16,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:00:16,999 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:00:16,999 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:00:16,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:00:16,999 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:00:17,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:00:17,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:00:17,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:00:17,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:00:17,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:00:17,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:00:17,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:00:17,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:00:17,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:00:17,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:00:17,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:00:17,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:00:17,002 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:00:17,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:00:17,003 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:00:17,003 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 03:00:17,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:00:17,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:00:17,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:00:17,309 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:00:17,310 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:00:17,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2023-08-29 03:00:18,604 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:00:18,918 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:00:18,919 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2023-08-29 03:00:18,932 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e0b08b1/45611b4c0c5a47f58c67bc0102b770e0/FLAG4fb4b23c5 [2023-08-29 03:00:18,949 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e0b08b1/45611b4c0c5a47f58c67bc0102b770e0 [2023-08-29 03:00:18,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:00:18,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:00:18,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:00:18,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:00:18,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:00:18,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:00:18" (1/1) ... [2023-08-29 03:00:18,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6f8ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:18, skipping insertion in model container [2023-08-29 03:00:18,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:00:18" (1/1) ... [2023-08-29 03:00:18,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:00:19,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:00:19,462 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2023-08-29 03:00:19,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:00:19,527 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:00:19,562 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2023-08-29 03:00:19,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:00:19,706 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:00:19,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19 WrapperNode [2023-08-29 03:00:19,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:00:19,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:00:19,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:00:19,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:00:19,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,796 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 256 [2023-08-29 03:00:19,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:00:19,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:00:19,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:00:19,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:00:19,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:00:19,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:00:19,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:00:19,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:00:19,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (1/1) ... [2023-08-29 03:00:19,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:00:19,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:19,918 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) [2023-08-29 03:00:19,942 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 [2023-08-29 03:00:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:00:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 03:00:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 03:00:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:00:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:00:19,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:00:19,963 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 03:00:20,095 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:00:20,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:00:20,499 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:00:20,507 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:00:20,508 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 03:00:20,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:00:20 BoogieIcfgContainer [2023-08-29 03:00:20,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:00:20,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:00:20,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:00:20,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:00:20,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:00:18" (1/3) ... [2023-08-29 03:00:20,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bb0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:00:20, skipping insertion in model container [2023-08-29 03:00:20,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:19" (2/3) ... [2023-08-29 03:00:20,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bb0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:00:20, skipping insertion in model container [2023-08-29 03:00:20,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:00:20" (3/3) ... [2023-08-29 03:00:20,519 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2023-08-29 03:00:20,526 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:00:20,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:00:20,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 03:00:20,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:00:20,646 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 03:00:20,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,830 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:20,831 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:20,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:20,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,869 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:20,882 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,886 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:20,960 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:20,961 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:20,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:20,980 INFO L119 LiptonReduction]: Number of co-enabled transitions 23920 [2023-08-29 03:00:23,966 INFO L134 LiptonReduction]: Checked pairs total: 95023 [2023-08-29 03:00:23,966 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-08-29 03:00:23,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:00:23,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b84b63f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:23,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 03:00:24,001 INFO L130 PetriNetUnfolder]: 14/76 cut-off events. [2023-08-29 03:00:24,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:24,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:24,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:24,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:24,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash -120121625, now seen corresponding path program 1 times [2023-08-29 03:00:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410829809] [2023-08-29 03:00:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410829809] [2023-08-29 03:00:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410829809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:24,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:24,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211079777] [2023-08-29 03:00:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:24,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 428 [2023-08-29 03:00:24,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:24,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 428 [2023-08-29 03:00:24,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:24,635 INFO L130 PetriNetUnfolder]: 399/1539 cut-off events. [2023-08-29 03:00:24,636 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2023-08-29 03:00:24,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1539 events. 399/1539 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10819 event pairs, 357 based on Foata normal form. 160/1537 useless extension candidates. Maximal degree in co-relation 2226. Up to 779 conditions per place. [2023-08-29 03:00:24,644 INFO L137 encePairwiseOnDemand]: 404/428 looper letters, 43 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-08-29 03:00:24,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 322 flow [2023-08-29 03:00:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2023-08-29 03:00:24,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.589563862928349 [2023-08-29 03:00:24,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 757 transitions. [2023-08-29 03:00:24,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 757 transitions. [2023-08-29 03:00:24,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:24,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 757 transitions. [2023-08-29 03:00:24,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,679 INFO L175 Difference]: Start difference. First operand has 110 places, 132 transitions, 272 flow. Second operand 3 states and 757 transitions. [2023-08-29 03:00:24,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 322 flow [2023-08-29 03:00:24,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:24,685 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 242 flow [2023-08-29 03:00:24,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2023-08-29 03:00:24,690 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2023-08-29 03:00:24,690 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 242 flow [2023-08-29 03:00:24,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:24,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:24,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:00:24,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:24,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1887140359, now seen corresponding path program 1 times [2023-08-29 03:00:24,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:24,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854213924] [2023-08-29 03:00:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854213924] [2023-08-29 03:00:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854213924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856186023] [2023-08-29 03:00:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:24,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:24,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 03:00:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 03:00:24,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:24,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856186023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 03:00:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659068760] [2023-08-29 03:00:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:24,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:24,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:00:24,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 428 [2023-08-29 03:00:24,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:24,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:24,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 428 [2023-08-29 03:00:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:25,200 INFO L130 PetriNetUnfolder]: 397/1518 cut-off events. [2023-08-29 03:00:25,200 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:00:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1518 events. 397/1518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10722 event pairs, 280 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 2285. Up to 743 conditions per place. [2023-08-29 03:00:25,207 INFO L137 encePairwiseOnDemand]: 425/428 looper letters, 61 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2023-08-29 03:00:25,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 130 transitions, 404 flow [2023-08-29 03:00:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2023-08-29 03:00:25,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5864485981308412 [2023-08-29 03:00:25,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 753 transitions. [2023-08-29 03:00:25,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 753 transitions. [2023-08-29 03:00:25,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:25,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 753 transitions. [2023-08-29 03:00:25,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,216 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 242 flow. Second operand 3 states and 753 transitions. [2023-08-29 03:00:25,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 130 transitions, 404 flow [2023-08-29 03:00:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 400 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:25,221 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 246 flow [2023-08-29 03:00:25,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2023-08-29 03:00:25,222 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2023-08-29 03:00:25,222 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 246 flow [2023-08-29 03:00:25,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:25,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:25,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:25,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:25,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:25,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -528961199, now seen corresponding path program 1 times [2023-08-29 03:00:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:25,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065009092] [2023-08-29 03:00:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065009092] [2023-08-29 03:00:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065009092] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603078963] [2023-08-29 03:00:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:25,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:25,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 03:00:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:25,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:25,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:25,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603078963] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:25,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821044097] [2023-08-29 03:00:25,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:25,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:25,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 428 [2023-08-29 03:00:25,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:25,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 428 [2023-08-29 03:00:25,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:25,904 INFO L130 PetriNetUnfolder]: 397/1508 cut-off events. [2023-08-29 03:00:25,905 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 03:00:25,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1508 events. 397/1508 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10588 event pairs, 357 based on Foata normal form. 3/1367 useless extension candidates. Maximal degree in co-relation 2317. Up to 762 conditions per place. [2023-08-29 03:00:25,911 INFO L137 encePairwiseOnDemand]: 425/428 looper letters, 43 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2023-08-29 03:00:25,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 354 flow [2023-08-29 03:00:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-29 03:00:25,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5549065420560748 [2023-08-29 03:00:25,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-29 03:00:25,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-29 03:00:25,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:25,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-29 03:00:25,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,927 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,927 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 246 flow. Second operand 6 states and 1425 transitions. [2023-08-29 03:00:25,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 354 flow [2023-08-29 03:00:25,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:00:25,934 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 278 flow [2023-08-29 03:00:25,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2023-08-29 03:00:25,936 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2023-08-29 03:00:25,936 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 278 flow [2023-08-29 03:00:25,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:25,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:25,938 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:25,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 03:00:26,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-29 03:00:26,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:26,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash -481369795, now seen corresponding path program 2 times [2023-08-29 03:00:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349999881] [2023-08-29 03:00:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349999881] [2023-08-29 03:00:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349999881] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915588182] [2023-08-29 03:00:26,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:26,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:26,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 03:00:26,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 03:00:26,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:26,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 03:00:26,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:26,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 03:00:26,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 03:00:26,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:26,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 03:00:26,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:26,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 03:00:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:26,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915588182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:26,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-29 03:00:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285491694] [2023-08-29 03:00:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:26,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-29 03:00:26,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 428 [2023-08-29 03:00:26,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 197.16666666666666) internal successors, (1183), 6 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:26,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:26,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 428 [2023-08-29 03:00:26,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:27,830 INFO L130 PetriNetUnfolder]: 1928/5365 cut-off events. [2023-08-29 03:00:27,831 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 03:00:27,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9483 conditions, 5365 events. 1928/5365 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 42616 event pairs, 681 based on Foata normal form. 0/4832 useless extension candidates. Maximal degree in co-relation 9448. Up to 1872 conditions per place. [2023-08-29 03:00:27,858 INFO L137 encePairwiseOnDemand]: 400/428 looper letters, 204 selfloop transitions, 52 changer transitions 0/294 dead transitions. [2023-08-29 03:00:27,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 294 transitions, 1172 flow [2023-08-29 03:00:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-29 03:00:27,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5549065420560748 [2023-08-29 03:00:27,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-29 03:00:27,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-29 03:00:27,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:27,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-29 03:00:27,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:27,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:27,873 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:27,873 INFO L175 Difference]: Start difference. First operand has 121 places, 115 transitions, 278 flow. Second operand 6 states and 1425 transitions. [2023-08-29 03:00:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 294 transitions, 1172 flow [2023-08-29 03:00:27,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 294 transitions, 1158 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:27,884 INFO L231 Difference]: Finished difference. Result has 129 places, 166 transitions, 610 flow [2023-08-29 03:00:27,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=129, PETRI_TRANSITIONS=166} [2023-08-29 03:00:27,886 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 19 predicate places. [2023-08-29 03:00:27,886 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 166 transitions, 610 flow [2023-08-29 03:00:27,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.16666666666666) internal successors, (1183), 6 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:27,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:27,887 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:27,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:28,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:28,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 998356130, now seen corresponding path program 1 times [2023-08-29 03:00:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018562790] [2023-08-29 03:00:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:28,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018562790] [2023-08-29 03:00:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018562790] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548479898] [2023-08-29 03:00:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:28,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:28,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:28,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 03:00:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:28,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:00:28,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:28,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548479898] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:28,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-29 03:00:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242538153] [2023-08-29 03:00:28,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 03:00:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:28,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 03:00:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-29 03:00:28,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 428 [2023-08-29 03:00:28,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 166 transitions, 610 flow. Second operand has 14 states, 14 states have (on average 227.78571428571428) internal successors, (3189), 14 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:28,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:28,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 428 [2023-08-29 03:00:28,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:28,537 INFO L130 PetriNetUnfolder]: 37/153 cut-off events. [2023-08-29 03:00:28,537 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-29 03:00:28,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 153 events. 37/153 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 382 event pairs, 0 based on Foata normal form. 25/170 useless extension candidates. Maximal degree in co-relation 318. Up to 74 conditions per place. [2023-08-29 03:00:28,538 INFO L137 encePairwiseOnDemand]: 423/428 looper letters, 24 selfloop transitions, 13 changer transitions 20/79 dead transitions. [2023-08-29 03:00:28,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 378 flow [2023-08-29 03:00:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 03:00:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 03:00:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3222 transitions. [2023-08-29 03:00:28,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.537716955941255 [2023-08-29 03:00:28,547 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3222 transitions. [2023-08-29 03:00:28,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3222 transitions. [2023-08-29 03:00:28,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:28,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3222 transitions. [2023-08-29 03:00:28,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 230.14285714285714) internal successors, (3222), 14 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:28,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 428.0) internal successors, (6420), 15 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:28,568 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 428.0) internal successors, (6420), 15 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:28,568 INFO L175 Difference]: Start difference. First operand has 129 places, 166 transitions, 610 flow. Second operand 14 states and 3222 transitions. [2023-08-29 03:00:28,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 378 flow [2023-08-29 03:00:28,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 311 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-08-29 03:00:28,571 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 175 flow [2023-08-29 03:00:28,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=175, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-29 03:00:28,572 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -36 predicate places. [2023-08-29 03:00:28,573 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 175 flow [2023-08-29 03:00:28,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 227.78571428571428) internal successors, (3189), 14 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:28,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:28,574 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:28,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:28,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:28,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:28,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1472942479, now seen corresponding path program 1 times [2023-08-29 03:00:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329595069] [2023-08-29 03:00:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:00:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329595069] [2023-08-29 03:00:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329595069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:00:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625511279] [2023-08-29 03:00:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:29,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:00:29,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 428 [2023-08-29 03:00:29,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:29,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:29,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 428 [2023-08-29 03:00:29,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:29,547 INFO L130 PetriNetUnfolder]: 53/160 cut-off events. [2023-08-29 03:00:29,548 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 03:00:29,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 160 events. 53/160 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 238 event pairs, 42 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 318. Up to 123 conditions per place. [2023-08-29 03:00:29,549 INFO L137 encePairwiseOnDemand]: 422/428 looper letters, 45 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-29 03:00:29,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 297 flow [2023-08-29 03:00:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-29 03:00:29,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434190031152648 [2023-08-29 03:00:29,556 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-29 03:00:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-29 03:00:29,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:29,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-29 03:00:29,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:29,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:29,582 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:29,582 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 175 flow. Second operand 6 states and 1115 transitions. [2023-08-29 03:00:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 297 flow [2023-08-29 03:00:29,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 225 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-29 03:00:29,584 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 115 flow [2023-08-29 03:00:29,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-29 03:00:29,585 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -54 predicate places. [2023-08-29 03:00:29,585 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 115 flow [2023-08-29 03:00:29,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:29,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:29,586 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:29,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:00:29,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:29,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -662430115, now seen corresponding path program 1 times [2023-08-29 03:00:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134747162] [2023-08-29 03:00:29,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:00:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134747162] [2023-08-29 03:00:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134747162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:00:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108046660] [2023-08-29 03:00:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:00:30,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 428 [2023-08-29 03:00:30,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:30,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 428 [2023-08-29 03:00:30,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:30,491 INFO L130 PetriNetUnfolder]: 53/158 cut-off events. [2023-08-29 03:00:30,491 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:30,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 158 events. 53/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 240 event pairs, 44 based on Foata normal form. 3/160 useless extension candidates. Maximal degree in co-relation 315. Up to 128 conditions per place. [2023-08-29 03:00:30,492 INFO L137 encePairwiseOnDemand]: 423/428 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2023-08-29 03:00:30,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 233 flow [2023-08-29 03:00:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-29 03:00:30,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434190031152648 [2023-08-29 03:00:30,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-29 03:00:30,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-29 03:00:30,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:30,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-29 03:00:30,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,505 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,505 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 115 flow. Second operand 6 states and 1115 transitions. [2023-08-29 03:00:30,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 233 flow [2023-08-29 03:00:30,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 223 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:00:30,507 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2023-08-29 03:00:30,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2023-08-29 03:00:30,508 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -55 predicate places. [2023-08-29 03:00:30,508 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2023-08-29 03:00:30,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2023-08-29 03:00:30,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-08-29 03:00:30,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-08-29 03:00:30,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-08-29 03:00:30,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-08-29 03:00:30,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-08-29 03:00:30,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-08-29 03:00:30,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-08-29 03:00:30,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-08-29 03:00:30,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-08-29 03:00:30,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-08-29 03:00:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:00:30,515 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-29 03:00:30,518 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 03:00:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:30,560 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:30,560 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:30,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:30,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:30,566 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:30,566 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:30,567 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:30,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:30,599 INFO L130 PetriNetUnfolder]: 44/369 cut-off events. [2023-08-29 03:00:30,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:30,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 369 events. 44/369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1419 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:30,611 INFO L119 LiptonReduction]: Number of co-enabled transitions 23920 [2023-08-29 03:00:33,101 INFO L134 LiptonReduction]: Checked pairs total: 94118 [2023-08-29 03:00:33,101 INFO L136 LiptonReduction]: Total number of compositions: 160 [2023-08-29 03:00:33,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 03:00:33,104 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b84b63f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:33,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 03:00:33,107 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2023-08-29 03:00:33,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:33,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:33,108 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 03:00:33,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:33,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 787742204, now seen corresponding path program 1 times [2023-08-29 03:00:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712607486] [2023-08-29 03:00:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712607486] [2023-08-29 03:00:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712607486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:33,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82494176] [2023-08-29 03:00:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:33,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 425 [2023-08-29 03:00:33,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:33,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 425 [2023-08-29 03:00:33,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:33,293 INFO L130 PetriNetUnfolder]: 380/1485 cut-off events. [2023-08-29 03:00:33,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:33,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1485 events. 380/1485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10383 event pairs, 340 based on Foata normal form. 156/1502 useless extension candidates. Maximal degree in co-relation 2140. Up to 741 conditions per place. [2023-08-29 03:00:33,297 INFO L137 encePairwiseOnDemand]: 400/425 looper letters, 23 selfloop transitions, 2 changer transitions 53/109 dead transitions. [2023-08-29 03:00:33,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 307 flow [2023-08-29 03:00:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2023-08-29 03:00:33,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592156862745098 [2023-08-29 03:00:33,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 755 transitions. [2023-08-29 03:00:33,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 755 transitions. [2023-08-29 03:00:33,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:33,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 755 transitions. [2023-08-29 03:00:33,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,306 INFO L175 Difference]: Start difference. First operand has 109 places, 130 transitions, 265 flow. Second operand 3 states and 755 transitions. [2023-08-29 03:00:33,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 307 flow [2023-08-29 03:00:33,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:33,308 INFO L231 Difference]: Finished difference. Result has 111 places, 56 transitions, 127 flow [2023-08-29 03:00:33,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=111, PETRI_TRANSITIONS=56} [2023-08-29 03:00:33,310 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 2 predicate places. [2023-08-29 03:00:33,310 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 56 transitions, 127 flow [2023-08-29 03:00:33,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:33,311 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:33,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:00:33,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:33,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1295383115, now seen corresponding path program 1 times [2023-08-29 03:00:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730743521] [2023-08-29 03:00:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730743521] [2023-08-29 03:00:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730743521] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553114160] [2023-08-29 03:00:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:33,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:33,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 03:00:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:33,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:33,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553114160] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:33,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895959226] [2023-08-29 03:00:33,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:33,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:33,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:33,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 425 [2023-08-29 03:00:33,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 56 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 230.57142857142858) internal successors, (1614), 7 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:33,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 425 [2023-08-29 03:00:33,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:33,545 INFO L130 PetriNetUnfolder]: 56/254 cut-off events. [2023-08-29 03:00:33,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:33,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 254 events. 56/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 391. Up to 129 conditions per place. [2023-08-29 03:00:33,546 INFO L137 encePairwiseOnDemand]: 422/425 looper letters, 23 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-29 03:00:33,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 195 flow [2023-08-29 03:00:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1405 transitions. [2023-08-29 03:00:33,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509803921568628 [2023-08-29 03:00:33,550 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1405 transitions. [2023-08-29 03:00:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1405 transitions. [2023-08-29 03:00:33,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:33,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1405 transitions. [2023-08-29 03:00:33,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 234.16666666666666) internal successors, (1405), 6 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,565 INFO L175 Difference]: Start difference. First operand has 111 places, 56 transitions, 127 flow. Second operand 6 states and 1405 transitions. [2023-08-29 03:00:33,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 195 flow [2023-08-29 03:00:33,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 191 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:33,567 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 159 flow [2023-08-29 03:00:33,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-29 03:00:33,568 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -43 predicate places. [2023-08-29 03:00:33,569 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 159 flow [2023-08-29 03:00:33,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.57142857142858) internal successors, (1614), 7 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:33,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:33,570 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-29 03:00:33,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:33,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:33,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2014618684, now seen corresponding path program 2 times [2023-08-29 03:00:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697151978] [2023-08-29 03:00:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697151978] [2023-08-29 03:00:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697151978] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394865963] [2023-08-29 03:00:33,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:33,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:33,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 03:00:33,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 03:00:33,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:33,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:00:33,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394865963] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:33,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 03:00:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015750275] [2023-08-29 03:00:33,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:33,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 03:00:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 03:00:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 03:00:34,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 425 [2023-08-29 03:00:34,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 159 flow. Second operand has 13 states, 13 states have (on average 230.30769230769232) internal successors, (2994), 13 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:34,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:34,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 425 [2023-08-29 03:00:34,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:34,097 INFO L130 PetriNetUnfolder]: 56/260 cut-off events. [2023-08-29 03:00:34,098 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 03:00:34,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 260 events. 56/260 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 51 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 382. Up to 129 conditions per place. [2023-08-29 03:00:34,099 INFO L137 encePairwiseOnDemand]: 422/425 looper letters, 23 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-08-29 03:00:34,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 65 transitions, 263 flow [2023-08-29 03:00:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 03:00:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 03:00:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2788 transitions. [2023-08-29 03:00:34,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2023-08-29 03:00:34,106 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2788 transitions. [2023-08-29 03:00:34,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2788 transitions. [2023-08-29 03:00:34,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:34,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2788 transitions. [2023-08-29 03:00:34,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:34,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 425.0) internal successors, (5525), 13 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:34,120 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 425.0) internal successors, (5525), 13 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:34,120 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 159 flow. Second operand 12 states and 2788 transitions. [2023-08-29 03:00:34,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 65 transitions, 263 flow [2023-08-29 03:00:34,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:34,122 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 229 flow [2023-08-29 03:00:34,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=229, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-08-29 03:00:34,123 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -27 predicate places. [2023-08-29 03:00:34,123 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 229 flow [2023-08-29 03:00:34,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 230.30769230769232) internal successors, (2994), 13 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:34,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:34,125 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-29 03:00:34,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:34,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:34,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:34,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1570766436, now seen corresponding path program 3 times [2023-08-29 03:00:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754847508] [2023-08-29 03:00:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:00:34,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 03:00:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:00:34,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 03:00:34,388 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 03:00:34,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 03:00:34,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 03:00:34,389 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 03:00:34,390 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 03:00:34,390 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 03:00:34,390 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 03:00:34,436 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 03:00:34,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,508 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:00:34,509 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:00:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:00:34,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,525 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:34,525 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:34,613 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:00:34,613 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:00:34,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:00:34,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 71760 [2023-08-29 03:00:37,964 INFO L134 LiptonReduction]: Checked pairs total: 284693 [2023-08-29 03:00:37,965 INFO L136 LiptonReduction]: Total number of compositions: 220 [2023-08-29 03:00:37,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:00:37,968 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b84b63f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:37,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-29 03:00:37,973 INFO L130 PetriNetUnfolder]: 15/86 cut-off events. [2023-08-29 03:00:37,973 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 03:00:37,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:37,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:37,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:37,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash 865883554, now seen corresponding path program 1 times [2023-08-29 03:00:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185981748] [2023-08-29 03:00:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185981748] [2023-08-29 03:00:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185981748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:37,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832627370] [2023-08-29 03:00:38,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:38,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 591 [2023-08-29 03:00:38,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 192 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:38,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:38,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 591 [2023-08-29 03:00:38,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:41,093 INFO L130 PetriNetUnfolder]: 14691/34824 cut-off events. [2023-08-29 03:00:41,094 INFO L131 PetriNetUnfolder]: For 206/254 co-relation queries the response was YES. [2023-08-29 03:00:41,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56201 conditions, 34824 events. 14691/34824 cut-off events. For 206/254 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 375543 event pairs, 13600 based on Foata normal form. 3905/35480 useless extension candidates. Maximal degree in co-relation 20590. Up to 21259 conditions per place. [2023-08-29 03:00:41,351 INFO L137 encePairwiseOnDemand]: 558/591 looper letters, 62 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-08-29 03:00:41,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 472 flow [2023-08-29 03:00:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1058 transitions. [2023-08-29 03:00:41,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5967287084038353 [2023-08-29 03:00:41,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1058 transitions. [2023-08-29 03:00:41,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1058 transitions. [2023-08-29 03:00:41,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:41,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1058 transitions. [2023-08-29 03:00:41,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:41,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:41,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:41,361 INFO L175 Difference]: Start difference. First operand has 161 places, 192 transitions, 402 flow. Second operand 3 states and 1058 transitions. [2023-08-29 03:00:41,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 472 flow [2023-08-29 03:00:41,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:41,364 INFO L231 Difference]: Finished difference. Result has 164 places, 163 transitions, 354 flow [2023-08-29 03:00:41,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=164, PETRI_TRANSITIONS=163} [2023-08-29 03:00:41,366 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2023-08-29 03:00:41,366 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 354 flow [2023-08-29 03:00:41,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:41,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:41,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:41,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 03:00:41,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:41,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1876810043, now seen corresponding path program 1 times [2023-08-29 03:00:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187226089] [2023-08-29 03:00:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187226089] [2023-08-29 03:00:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187226089] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389600700] [2023-08-29 03:00:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:41,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:41,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 03:00:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:41,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 03:00:41,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:41,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389600700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 03:00:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645607802] [2023-08-29 03:00:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:41,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:41,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:00:41,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 591 [2023-08-29 03:00:41,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 163 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:41,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:41,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 591 [2023-08-29 03:00:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:44,192 INFO L130 PetriNetUnfolder]: 14345/35073 cut-off events. [2023-08-29 03:00:44,192 INFO L131 PetriNetUnfolder]: For 169/188 co-relation queries the response was YES. [2023-08-29 03:00:44,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56456 conditions, 35073 events. 14345/35073 cut-off events. For 169/188 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 388169 event pairs, 6494 based on Foata normal form. 0/31798 useless extension candidates. Maximal degree in co-relation 56443. Up to 21223 conditions per place. [2023-08-29 03:00:44,431 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 81 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-08-29 03:00:44,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 182 transitions, 558 flow [2023-08-29 03:00:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2023-08-29 03:00:44,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.589960518894529 [2023-08-29 03:00:44,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1046 transitions. [2023-08-29 03:00:44,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1046 transitions. [2023-08-29 03:00:44,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:44,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1046 transitions. [2023-08-29 03:00:44,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:44,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:44,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:44,441 INFO L175 Difference]: Start difference. First operand has 164 places, 163 transitions, 354 flow. Second operand 3 states and 1046 transitions. [2023-08-29 03:00:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 182 transitions, 558 flow [2023-08-29 03:00:44,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 182 transitions, 554 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:44,446 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 362 flow [2023-08-29 03:00:44,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2023-08-29 03:00:44,447 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 5 predicate places. [2023-08-29 03:00:44,447 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 362 flow [2023-08-29 03:00:44,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:44,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:44,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:44,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:44,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:44,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:44,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1345218897, now seen corresponding path program 1 times [2023-08-29 03:00:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083017630] [2023-08-29 03:00:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083017630] [2023-08-29 03:00:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083017630] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212973701] [2023-08-29 03:00:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:44,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:44,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:44,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 03:00:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:44,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:44,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:44,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212973701] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:44,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:44,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982455828] [2023-08-29 03:00:44,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:44,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:44,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 591 [2023-08-29 03:00:44,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 321.85714285714283) internal successors, (2253), 7 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:44,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:44,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 591 [2023-08-29 03:00:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:47,558 INFO L130 PetriNetUnfolder]: 14723/35024 cut-off events. [2023-08-29 03:00:47,559 INFO L131 PetriNetUnfolder]: For 870/885 co-relation queries the response was YES. [2023-08-29 03:00:47,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57099 conditions, 35024 events. 14723/35024 cut-off events. For 870/885 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 378997 event pairs, 13600 based on Foata normal form. 3/32050 useless extension candidates. Maximal degree in co-relation 57071. Up to 21242 conditions per place. [2023-08-29 03:00:47,735 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 63 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2023-08-29 03:00:47,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 510 flow [2023-08-29 03:00:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2023-08-29 03:00:47,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611957134799774 [2023-08-29 03:00:47,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1990 transitions. [2023-08-29 03:00:47,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1990 transitions. [2023-08-29 03:00:47,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:47,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1990 transitions. [2023-08-29 03:00:47,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 331.6666666666667) internal successors, (1990), 6 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:47,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:47,749 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:47,749 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 362 flow. Second operand 6 states and 1990 transitions. [2023-08-29 03:00:47,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 510 flow [2023-08-29 03:00:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:47,753 INFO L231 Difference]: Finished difference. Result has 173 places, 167 transitions, 396 flow [2023-08-29 03:00:47,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=173, PETRI_TRANSITIONS=167} [2023-08-29 03:00:47,754 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 12 predicate places. [2023-08-29 03:00:47,754 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 167 transitions, 396 flow [2023-08-29 03:00:47,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 321.85714285714283) internal successors, (2253), 7 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:47,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:47,755 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:47,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:47,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-29 03:00:47,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:47,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1900216085, now seen corresponding path program 2 times [2023-08-29 03:00:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010207940] [2023-08-29 03:00:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010207940] [2023-08-29 03:00:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010207940] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808553762] [2023-08-29 03:00:48,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:48,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:48,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 03:00:48,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 03:00:48,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:48,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 03:00:48,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:48,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 03:00:48,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 03:00:48,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:48,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 03:00:48,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:48,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 03:00:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:48,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808553762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-29 03:00:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817791790] [2023-08-29 03:00:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:48,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:48,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-29 03:00:48,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 591 [2023-08-29 03:00:48,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 167 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 280.1666666666667) internal successors, (1681), 6 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:48,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:48,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 591 [2023-08-29 03:00:48,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:05,302 INFO L130 PetriNetUnfolder]: 118305/217170 cut-off events. [2023-08-29 03:01:05,303 INFO L131 PetriNetUnfolder]: For 4243/4280 co-relation queries the response was YES. [2023-08-29 03:01:05,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399706 conditions, 217170 events. 118305/217170 cut-off events. For 4243/4280 co-relation queries the response was YES. Maximal size of possible extension queue 4573. Compared 2329751 event pairs, 43562 based on Foata normal form. 0/198235 useless extension candidates. Maximal degree in co-relation 399670. Up to 82575 conditions per place. [2023-08-29 03:01:06,958 INFO L137 encePairwiseOnDemand]: 555/591 looper letters, 314 selfloop transitions, 72 changer transitions 0/450 dead transitions. [2023-08-29 03:01:06,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 450 transitions, 1802 flow [2023-08-29 03:01:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2048 transitions. [2023-08-29 03:01:06,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.577552171460801 [2023-08-29 03:01:06,962 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2048 transitions. [2023-08-29 03:01:06,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2048 transitions. [2023-08-29 03:01:06,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:06,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2048 transitions. [2023-08-29 03:01:06,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:06,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:06,973 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:06,973 INFO L175 Difference]: Start difference. First operand has 173 places, 167 transitions, 396 flow. Second operand 6 states and 2048 transitions. [2023-08-29 03:01:06,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 450 transitions, 1802 flow [2023-08-29 03:01:06,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 450 transitions, 1788 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:01:06,982 INFO L231 Difference]: Finished difference. Result has 181 places, 240 transitions, 868 flow [2023-08-29 03:01:06,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=181, PETRI_TRANSITIONS=240} [2023-08-29 03:01:06,982 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 20 predicate places. [2023-08-29 03:01:06,983 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 240 transitions, 868 flow [2023-08-29 03:01:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.1666666666667) internal successors, (1681), 6 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:06,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:06,983 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:06,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 03:01:07,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-29 03:01:07,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:07,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:07,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2124113616, now seen corresponding path program 1 times [2023-08-29 03:01:07,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:07,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196616883] [2023-08-29 03:01:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:01:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196616883] [2023-08-29 03:01:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196616883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:01:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101388069] [2023-08-29 03:01:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:01:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:01:07,236 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:01:07,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 03:01:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:07,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:01:07,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:01:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:01:07,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:01:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:01:07,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101388069] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:01:07,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:01:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-29 03:01:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248724235] [2023-08-29 03:01:07,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:01:07,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 03:01:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 03:01:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-29 03:01:07,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 591 [2023-08-29 03:01:07,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 240 transitions, 868 flow. Second operand has 14 states, 14 states have (on average 318.7857142857143) internal successors, (4463), 14 states have internal predecessors, (4463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:07,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:07,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 591 [2023-08-29 03:01:07,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:09,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true, 270#L956-66true]) [2023-08-29 03:01:09,447 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,447 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [192#L954-7true, 213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,448 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,448 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 03:01:09,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [32#L956-64true, 213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,577 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,577 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,577 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,577 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [59#L956-49true, 213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,578 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,578 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,578 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,578 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true, 270#L956-66true]) [2023-08-29 03:01:09,587 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,587 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,587 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,587 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, 192#L954-7true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,587 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,588 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,588 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,588 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 03:01:09,905 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 36#L956-54true, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:09,905 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,906 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,906 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,906 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,928 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [32#L956-64true, 79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:09,929 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [59#L956-49true, 79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,929 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,929 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true, 270#L956-66true]) [2023-08-29 03:01:09,941 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [192#L954-7true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:09,941 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:09,942 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 03:01:10,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 36#L956-54true, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:10,160 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,160 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,160 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,160 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), 115#L956-6true, Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:10,180 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,180 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,180 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,180 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,190 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [32#L956-64true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:10,190 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,190 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,190 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,190 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,191 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [59#L956-49true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:10,191 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,191 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,191 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,191 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 03:01:10,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, 36#L956-54true, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:10,411 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,411 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,411 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,411 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,435 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), 115#L956-6true, Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:10,435 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,435 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,435 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,435 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 03:01:10,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), 115#L956-6true, Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:10,696 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 03:01:10,696 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 03:01:10,696 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 03:01:10,697 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 03:01:11,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 151#L956-62true, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:11,466 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 03:01:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:01:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:01:11,466 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 03:01:11,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 93#L956-65true, 379#true]) [2023-08-29 03:01:11,844 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,844 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,844 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,844 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 151#L956-62true, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:11,845 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,845 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,845 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:11,845 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 03:01:12,078 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:12,078 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,078 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,079 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,079 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 93#L956-65true, 379#true]) [2023-08-29 03:01:12,080 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,080 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,080 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,080 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, 151#L956-62true, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,082 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,082 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,082 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,082 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, 52#L956-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,106 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,106 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,106 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,106 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:12,323 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 271#L958-4true, Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,323 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:12,324 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,324 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,325 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,325 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,325 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,326 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 93#L956-65true, 468#true, 532#true, 379#true]) [2023-08-29 03:01:12,326 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,326 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,326 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,326 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, 52#L956-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,351 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,351 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,351 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,351 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:12,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,731 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,731 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,731 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,731 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,731 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,732 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,732 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,732 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,733 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,733 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,734 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,734 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 52#L956-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:12,761 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,761 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,761 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,761 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:12,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), 271#L958-4true, Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:12,975 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:12,976 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:12,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:15,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:15,490 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2023-08-29 03:01:15,490 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-08-29 03:01:15,490 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-08-29 03:01:15,490 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-08-29 03:01:15,751 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), 271#L958-4true, Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:15,752 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,752 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,752 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,752 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,752 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:15,752 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,753 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,753 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:15,753 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:01:16,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 227#L945-45true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:16,611 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-29 03:01:16,611 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:01:16,611 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:01:16,611 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:01:16,820 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 271#L958-4true, Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:16,821 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,821 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,821 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,821 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:16,822 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,822 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,822 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,822 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:16,823 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,823 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,823 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:16,824 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:01:17,023 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 271#L958-4true, Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:17,024 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,024 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,024 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,024 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,024 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:17,024 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:17,025 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,025 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:01:17,400 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 271#L958-4true, Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:17,400 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,400 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_~#a~0.base_329|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_111| 28))) (and (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 1))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 2))) (= (select .cse0 (+ .cse1 |v_~#a~0.offset_316| 3)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|))) InVars {#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|} OutVars{#race=|v_#race_251|, ~#a~0.base=|v_~#a~0.base_329|, ~#a~0.offset=|v_~#a~0.offset_316|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_111|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][267], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 227#L945-45true, 180#ULTIMATE.startEXITtrue, 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:17,401 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:17,401 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:01:18,593 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:18,593 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2023-08-29 03:01:18,593 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:18,593 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:18,593 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:18,593 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:01:18,742 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:18,742 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2023-08-29 03:01:18,742 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,742 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,742 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,742 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), 271#L958-4true, Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:18,743 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,743 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [213#L945-22true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:18,744 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2023-08-29 03:01:18,744 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,744 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,744 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,744 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:01:18,894 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), 271#L958-4true, Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:18,894 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2023-08-29 03:01:18,894 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,894 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,894 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:18,895 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,895 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,896 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 532#true, 379#true]) [2023-08-29 03:01:18,896 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2023-08-29 03:01:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:01:19,042 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), 271#L958-4true, Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:19,042 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2023-08-29 03:01:19,042 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_~#a~0.base_279|)) (.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 3 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1 1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| 2 .cse1))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_~#a~0.offset_268| .cse1))))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, ~#a~0.base=|v_~#a~0.base_279|, ~#a~0.offset=|v_~#a~0.offset_268|, t_funThread2of2ForFork0_~i~0#1=|v_t_funThread2of2ForFork0_~i~0#1_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= 0 (select (select |#race| |~#a~0.base|) (+ 3 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 522#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0) (= (select (select |#race| |~#a~0.base|) (+ 2 (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0) (= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 514#(= (select (select |#race| |~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 221#L945-28true, 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 532#true, 468#true, 379#true]) [2023-08-29 03:01:19,043 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:19,043 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:01:20,489 INFO L130 PetriNetUnfolder]: 53826/139989 cut-off events. [2023-08-29 03:01:20,489 INFO L131 PetriNetUnfolder]: For 30686/45218 co-relation queries the response was YES. [2023-08-29 03:01:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273797 conditions, 139989 events. 53826/139989 cut-off events. For 30686/45218 co-relation queries the response was YES. Maximal size of possible extension queue 3502. Compared 1911235 event pairs, 6620 based on Foata normal form. 3311/129562 useless extension candidates. Maximal degree in co-relation 273739. Up to 76139 conditions per place. [2023-08-29 03:01:21,552 INFO L137 encePairwiseOnDemand]: 586/591 looper letters, 161 selfloop transitions, 14 changer transitions 0/319 dead transitions. [2023-08-29 03:01:21,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 319 transitions, 1488 flow [2023-08-29 03:01:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 03:01:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 03:01:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4572 transitions. [2023-08-29 03:01:21,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5525743292240755 [2023-08-29 03:01:21,561 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4572 transitions. [2023-08-29 03:01:21,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4572 transitions. [2023-08-29 03:01:21,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:21,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4572 transitions. [2023-08-29 03:01:21,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 326.57142857142856) internal successors, (4572), 14 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:21,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 591.0) internal successors, (8865), 15 states have internal predecessors, (8865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:21,582 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 591.0) internal successors, (8865), 15 states have internal predecessors, (8865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:21,582 INFO L175 Difference]: Start difference. First operand has 181 places, 240 transitions, 868 flow. Second operand 14 states and 4572 transitions. [2023-08-29 03:01:21,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 319 transitions, 1488 flow [2023-08-29 03:01:21,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 319 transitions, 1488 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:01:21,650 INFO L231 Difference]: Finished difference. Result has 195 places, 246 transitions, 938 flow [2023-08-29 03:01:21,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=938, PETRI_PLACES=195, PETRI_TRANSITIONS=246} [2023-08-29 03:01:21,652 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 34 predicate places. [2023-08-29 03:01:21,652 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 246 transitions, 938 flow [2023-08-29 03:01:21,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 318.7857142857143) internal successors, (4463), 14 states have internal predecessors, (4463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:21,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:21,653 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:21,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-29 03:01:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-29 03:01:21,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:21,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -634595861, now seen corresponding path program 1 times [2023-08-29 03:01:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752758283] [2023-08-29 03:01:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:01:22,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752758283] [2023-08-29 03:01:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752758283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:22,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:22,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:01:22,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367768736] [2023-08-29 03:01:22,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:22,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:01:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:01:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:01:22,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 591 [2023-08-29 03:01:22,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 246 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:22,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:22,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 591 [2023-08-29 03:01:22,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:19,240 INFO L130 PetriNetUnfolder]: 292109/586406 cut-off events. [2023-08-29 03:02:19,240 INFO L131 PetriNetUnfolder]: For 177331/200301 co-relation queries the response was YES. [2023-08-29 03:02:21,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286330 conditions, 586406 events. 292109/586406 cut-off events. For 177331/200301 co-relation queries the response was YES. Maximal size of possible extension queue 11387. Compared 7611756 event pairs, 87748 based on Foata normal form. 11494/544944 useless extension candidates. Maximal degree in co-relation 1286258. Up to 216430 conditions per place. [2023-08-29 03:02:24,036 INFO L137 encePairwiseOnDemand]: 555/591 looper letters, 451 selfloop transitions, 202 changer transitions 0/725 dead transitions. [2023-08-29 03:02:24,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 725 transitions, 4074 flow [2023-08-29 03:02:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2049 transitions. [2023-08-29 03:02:24,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.577834179357022 [2023-08-29 03:02:24,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2049 transitions. [2023-08-29 03:02:24,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2049 transitions. [2023-08-29 03:02:24,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:24,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2049 transitions. [2023-08-29 03:02:24,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 341.5) internal successors, (2049), 6 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:24,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:24,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:24,051 INFO L175 Difference]: Start difference. First operand has 195 places, 246 transitions, 938 flow. Second operand 6 states and 2049 transitions. [2023-08-29 03:02:24,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 725 transitions, 4074 flow [2023-08-29 03:02:24,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 725 transitions, 3996 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-29 03:02:24,432 INFO L231 Difference]: Finished difference. Result has 194 places, 457 transitions, 2678 flow [2023-08-29 03:02:24,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2678, PETRI_PLACES=194, PETRI_TRANSITIONS=457} [2023-08-29 03:02:24,433 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 33 predicate places. [2023-08-29 03:02:24,433 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 457 transitions, 2678 flow [2023-08-29 03:02:24,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:24,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:24,434 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:24,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 03:02:24,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:24,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1531199328, now seen corresponding path program 1 times [2023-08-29 03:02:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604286867] [2023-08-29 03:02:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:02:24,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604286867] [2023-08-29 03:02:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604286867] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:02:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823222195] [2023-08-29 03:02:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:02:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:02:24,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:02:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 03:02:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:24,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 03:02:24,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:02:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:02:24,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:02:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:02:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823222195] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:02:24,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:02:24,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-29 03:02:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552453634] [2023-08-29 03:02:24,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:02:24,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:02:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:02:24,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:02:24,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 591 [2023-08-29 03:02:24,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 457 transitions, 2678 flow. Second operand has 9 states, 9 states have (on average 322.6666666666667) internal successors, (2904), 9 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:24,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:24,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 591 [2023-08-29 03:02:24,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:26,073 INFO L130 PetriNetUnfolder]: 6068/13849 cut-off events. [2023-08-29 03:02:26,073 INFO L131 PetriNetUnfolder]: For 7767/8588 co-relation queries the response was YES. [2023-08-29 03:02:26,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36984 conditions, 13849 events. 6068/13849 cut-off events. For 7767/8588 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 129285 event pairs, 625 based on Foata normal form. 1801/14762 useless extension candidates. Maximal degree in co-relation 28505. Up to 7427 conditions per place. [2023-08-29 03:02:26,161 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 238 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2023-08-29 03:02:26,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 401 transitions, 2622 flow [2023-08-29 03:02:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 03:02:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 03:02:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1696 transitions. [2023-08-29 03:02:26,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739424703891709 [2023-08-29 03:02:26,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1696 transitions. [2023-08-29 03:02:26,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1696 transitions. [2023-08-29 03:02:26,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:26,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1696 transitions. [2023-08-29 03:02:26,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 339.2) internal successors, (1696), 5 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:26,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 591.0) internal successors, (3546), 6 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:26,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 591.0) internal successors, (3546), 6 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:26,172 INFO L175 Difference]: Start difference. First operand has 194 places, 457 transitions, 2678 flow. Second operand 5 states and 1696 transitions. [2023-08-29 03:02:26,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 401 transitions, 2622 flow [2023-08-29 03:02:26,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 401 transitions, 2616 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 03:02:26,204 INFO L231 Difference]: Finished difference. Result has 140 places, 280 transitions, 1522 flow [2023-08-29 03:02:26,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1522, PETRI_PLACES=140, PETRI_TRANSITIONS=280} [2023-08-29 03:02:26,204 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -21 predicate places. [2023-08-29 03:02:26,204 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 280 transitions, 1522 flow [2023-08-29 03:02:26,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 322.6666666666667) internal successors, (2904), 9 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:26,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:26,205 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:26,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-29 03:02:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-29 03:02:26,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:26,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1663368514, now seen corresponding path program 1 times [2023-08-29 03:02:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390585802] [2023-08-29 03:02:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:02:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390585802] [2023-08-29 03:02:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390585802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:26,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:26,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:02:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865332966] [2023-08-29 03:02:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:26,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:02:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:02:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:02:27,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 591 [2023-08-29 03:02:27,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 280 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:27,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:27,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 591 [2023-08-29 03:02:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:30,177 INFO L130 PetriNetUnfolder]: 18879/33584 cut-off events. [2023-08-29 03:02:30,178 INFO L131 PetriNetUnfolder]: For 28574/29135 co-relation queries the response was YES. [2023-08-29 03:02:30,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96405 conditions, 33584 events. 18879/33584 cut-off events. For 28574/29135 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 270171 event pairs, 11546 based on Foata normal form. 9/32845 useless extension candidates. Maximal degree in co-relation 76419. Up to 25670 conditions per place. [2023-08-29 03:02:30,370 INFO L137 encePairwiseOnDemand]: 564/591 looper letters, 376 selfloop transitions, 124 changer transitions 0/527 dead transitions. [2023-08-29 03:02:30,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 527 transitions, 3602 flow [2023-08-29 03:02:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2023-08-29 03:02:30,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946418499717992 [2023-08-29 03:02:30,373 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1754 transitions. [2023-08-29 03:02:30,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1754 transitions. [2023-08-29 03:02:30,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:30,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1754 transitions. [2023-08-29 03:02:30,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 292.3333333333333) internal successors, (1754), 6 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:30,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:30,380 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:30,380 INFO L175 Difference]: Start difference. First operand has 140 places, 280 transitions, 1522 flow. Second operand 6 states and 1754 transitions. [2023-08-29 03:02:30,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 527 transitions, 3602 flow [2023-08-29 03:02:30,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 527 transitions, 3585 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 03:02:30,433 INFO L231 Difference]: Finished difference. Result has 146 places, 384 transitions, 2589 flow [2023-08-29 03:02:30,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2589, PETRI_PLACES=146, PETRI_TRANSITIONS=384} [2023-08-29 03:02:30,434 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -15 predicate places. [2023-08-29 03:02:30,434 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 384 transitions, 2589 flow [2023-08-29 03:02:30,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:30,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:30,435 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:30,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 03:02:30,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:30,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1869216497, now seen corresponding path program 1 times [2023-08-29 03:02:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986139483] [2023-08-29 03:02:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:02:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:30,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986139483] [2023-08-29 03:02:30,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986139483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:30,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:02:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976950657] [2023-08-29 03:02:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:30,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:02:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:02:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:02:31,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 591 [2023-08-29 03:02:31,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 384 transitions, 2589 flow. Second operand has 6 states, 6 states have (on average 253.5) internal successors, (1521), 6 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:31,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:31,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 591 [2023-08-29 03:02:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:35,350 INFO L130 PetriNetUnfolder]: 21620/38089 cut-off events. [2023-08-29 03:02:35,350 INFO L131 PetriNetUnfolder]: For 39954/40743 co-relation queries the response was YES. [2023-08-29 03:02:35,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121033 conditions, 38089 events. 21620/38089 cut-off events. For 39954/40743 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 310736 event pairs, 12729 based on Foata normal form. 18/37346 useless extension candidates. Maximal degree in co-relation 96231. Up to 29979 conditions per place. [2023-08-29 03:02:35,598 INFO L137 encePairwiseOnDemand]: 564/591 looper letters, 499 selfloop transitions, 147 changer transitions 0/668 dead transitions. [2023-08-29 03:02:35,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 668 transitions, 5301 flow [2023-08-29 03:02:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2023-08-29 03:02:35,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49379582628313595 [2023-08-29 03:02:35,600 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1751 transitions. [2023-08-29 03:02:35,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1751 transitions. [2023-08-29 03:02:35,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:35,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1751 transitions. [2023-08-29 03:02:35,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 291.8333333333333) internal successors, (1751), 6 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:35,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:35,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:35,607 INFO L175 Difference]: Start difference. First operand has 146 places, 384 transitions, 2589 flow. Second operand 6 states and 1751 transitions. [2023-08-29 03:02:35,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 668 transitions, 5301 flow [2023-08-29 03:02:35,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 668 transitions, 5179 flow, removed 61 selfloop flow, removed 0 redundant places. [2023-08-29 03:02:35,780 INFO L231 Difference]: Finished difference. Result has 155 places, 494 transitions, 3759 flow [2023-08-29 03:02:35,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3759, PETRI_PLACES=155, PETRI_TRANSITIONS=494} [2023-08-29 03:02:35,780 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -6 predicate places. [2023-08-29 03:02:35,780 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 494 transitions, 3759 flow [2023-08-29 03:02:35,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.5) internal successors, (1521), 6 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:35,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:35,781 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:35,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 03:02:35,781 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:35,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1854585078, now seen corresponding path program 1 times [2023-08-29 03:02:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:35,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634431219] [2023-08-29 03:02:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 03:02:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634431219] [2023-08-29 03:02:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634431219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 03:02:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276919547] [2023-08-29 03:02:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 03:02:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 03:02:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:02:36,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 591 [2023-08-29 03:02:36,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 494 transitions, 3759 flow. Second operand has 5 states, 5 states have (on average 304.4) internal successors, (1522), 5 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:36,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:36,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 591 [2023-08-29 03:02:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:37,157 INFO L130 PetriNetUnfolder]: 1257/3662 cut-off events. [2023-08-29 03:02:37,158 INFO L131 PetriNetUnfolder]: For 2721/2721 co-relation queries the response was YES. [2023-08-29 03:02:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10765 conditions, 3662 events. 1257/3662 cut-off events. For 2721/2721 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 27206 event pairs, 442 based on Foata normal form. 207/3742 useless extension candidates. Maximal degree in co-relation 6864. Up to 1318 conditions per place. [2023-08-29 03:02:37,184 INFO L137 encePairwiseOnDemand]: 576/591 looper letters, 70 selfloop transitions, 15 changer transitions 9/147 dead transitions. [2023-08-29 03:02:37,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 147 transitions, 875 flow [2023-08-29 03:02:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 03:02:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 03:02:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1288 transitions. [2023-08-29 03:02:37,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.544839255499154 [2023-08-29 03:02:37,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1288 transitions. [2023-08-29 03:02:37,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1288 transitions. [2023-08-29 03:02:37,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:37,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1288 transitions. [2023-08-29 03:02:37,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:37,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 591.0) internal successors, (2955), 5 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:37,190 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 591.0) internal successors, (2955), 5 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:37,190 INFO L175 Difference]: Start difference. First operand has 155 places, 494 transitions, 3759 flow. Second operand 4 states and 1288 transitions. [2023-08-29 03:02:37,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 147 transitions, 875 flow [2023-08-29 03:02:37,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 147 transitions, 573 flow, removed 76 selfloop flow, removed 32 redundant places. [2023-08-29 03:02:37,214 INFO L231 Difference]: Finished difference. Result has 119 places, 114 transitions, 345 flow [2023-08-29 03:02:37,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=119, PETRI_TRANSITIONS=114} [2023-08-29 03:02:37,214 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -42 predicate places. [2023-08-29 03:02:37,214 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 114 transitions, 345 flow [2023-08-29 03:02:37,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 304.4) internal successors, (1522), 5 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:37,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:37,215 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:37,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 03:02:37,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:37,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -264043872, now seen corresponding path program 1 times [2023-08-29 03:02:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599805334] [2023-08-29 03:02:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:02:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599805334] [2023-08-29 03:02:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599805334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:02:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481627384] [2023-08-29 03:02:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:37,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:02:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:02:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:02:37,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 591 [2023-08-29 03:02:37,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 114 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 255.16666666666666) internal successors, (1531), 6 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:37,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:37,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 591 [2023-08-29 03:02:37,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:38,307 INFO L130 PetriNetUnfolder]: 2557/5109 cut-off events. [2023-08-29 03:02:38,307 INFO L131 PetriNetUnfolder]: For 1651/1657 co-relation queries the response was YES. [2023-08-29 03:02:38,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13233 conditions, 5109 events. 2557/5109 cut-off events. For 1651/1657 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 32039 event pairs, 2310 based on Foata normal form. 0/4864 useless extension candidates. Maximal degree in co-relation 4452. Up to 4455 conditions per place. [2023-08-29 03:02:38,321 INFO L137 encePairwiseOnDemand]: 585/591 looper letters, 104 selfloop transitions, 5 changer transitions 22/145 dead transitions. [2023-08-29 03:02:38,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 145 transitions, 719 flow [2023-08-29 03:02:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1608 transitions. [2023-08-29 03:02:38,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45346869712351945 [2023-08-29 03:02:38,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1608 transitions. [2023-08-29 03:02:38,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1608 transitions. [2023-08-29 03:02:38,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:38,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1608 transitions. [2023-08-29 03:02:38,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:38,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:38,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:38,327 INFO L175 Difference]: Start difference. First operand has 119 places, 114 transitions, 345 flow. Second operand 6 states and 1608 transitions. [2023-08-29 03:02:38,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 145 transitions, 719 flow [2023-08-29 03:02:38,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:02:38,332 INFO L231 Difference]: Finished difference. Result has 122 places, 99 transitions, 301 flow [2023-08-29 03:02:38,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2023-08-29 03:02:38,333 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -39 predicate places. [2023-08-29 03:02:38,333 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 301 flow [2023-08-29 03:02:38,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.16666666666666) internal successors, (1531), 6 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:38,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:38,333 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:38,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 03:02:38,333 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:02:38,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2023345242, now seen corresponding path program 1 times [2023-08-29 03:02:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228993532] [2023-08-29 03:02:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:02:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228993532] [2023-08-29 03:02:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228993532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:02:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779227380] [2023-08-29 03:02:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:38,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:02:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:02:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:02:39,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 591 [2023-08-29 03:02:39,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:39,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:39,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 591 [2023-08-29 03:02:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:39,489 INFO L130 PetriNetUnfolder]: 1618/3264 cut-off events. [2023-08-29 03:02:39,490 INFO L131 PetriNetUnfolder]: For 1051/1051 co-relation queries the response was YES. [2023-08-29 03:02:39,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8433 conditions, 3264 events. 1618/3264 cut-off events. For 1051/1051 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18209 event pairs, 1461 based on Foata normal form. 0/3166 useless extension candidates. Maximal degree in co-relation 6932. Up to 2841 conditions per place. [2023-08-29 03:02:39,496 INFO L137 encePairwiseOnDemand]: 585/591 looper letters, 0 selfloop transitions, 0 changer transitions 122/122 dead transitions. [2023-08-29 03:02:39,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 122 transitions, 591 flow [2023-08-29 03:02:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2023-08-29 03:02:39,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4500846023688663 [2023-08-29 03:02:39,498 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2023-08-29 03:02:39,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2023-08-29 03:02:39,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:39,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2023-08-29 03:02:39,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:39,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:39,501 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:39,501 INFO L175 Difference]: Start difference. First operand has 122 places, 99 transitions, 301 flow. Second operand 6 states and 1596 transitions. [2023-08-29 03:02:39,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 122 transitions, 591 flow [2023-08-29 03:02:39,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 122 transitions, 565 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 03:02:39,504 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2023-08-29 03:02:39,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2023-08-29 03:02:39,505 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -51 predicate places. [2023-08-29 03:02:39,505 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2023-08-29 03:02:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:39,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2023-08-29 03:02:39,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2023-08-29 03:02:39,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2023-08-29 03:02:39,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2023-08-29 03:02:39,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2023-08-29 03:02:39,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2023-08-29 03:02:39,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2023-08-29 03:02:39,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2023-08-29 03:02:39,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2023-08-29 03:02:39,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 03:02:39,508 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:39,508 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 03:02:39,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,559 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:02:39,560 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:02:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:02:39,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,567 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:02:39,568 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,568 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:02:39,612 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:02:39,613 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:02:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:02:39,638 INFO L119 LiptonReduction]: Number of co-enabled transitions 71760 [2023-08-29 03:02:42,567 INFO L134 LiptonReduction]: Checked pairs total: 284627 [2023-08-29 03:02:42,567 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-08-29 03:02:42,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 03:02:42,569 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b84b63f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:02:42,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 03:02:42,575 INFO L130 PetriNetUnfolder]: 22/114 cut-off events. [2023-08-29 03:02:42,575 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 03:02:42,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:42,575 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:02:42,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:02:42,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1583915580, now seen corresponding path program 1 times [2023-08-29 03:02:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123158629] [2023-08-29 03:02:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123158629] [2023-08-29 03:02:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123158629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:42,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:42,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:02:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034213475] [2023-08-29 03:02:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:42,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:02:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:02:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:02:42,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 594 [2023-08-29 03:02:42,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 194 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:42,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:42,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 594 [2023-08-29 03:02:42,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:44,652 INFO L130 PetriNetUnfolder]: 14691/34824 cut-off events. [2023-08-29 03:02:44,652 INFO L131 PetriNetUnfolder]: For 206/254 co-relation queries the response was YES. [2023-08-29 03:02:44,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56201 conditions, 34824 events. 14691/34824 cut-off events. For 206/254 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 375579 event pairs, 13600 based on Foata normal form. 4492/36067 useless extension candidates. Maximal degree in co-relation 20590. Up to 21259 conditions per place. [2023-08-29 03:02:44,748 INFO L137 encePairwiseOnDemand]: 559/594 looper letters, 41 selfloop transitions, 2 changer transitions 58/163 dead transitions. [2023-08-29 03:02:44,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 472 flow [2023-08-29 03:02:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:02:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:02:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2023-08-29 03:02:44,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5948372615039281 [2023-08-29 03:02:44,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2023-08-29 03:02:44,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2023-08-29 03:02:44,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:44,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2023-08-29 03:02:44,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:44,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 594.0) internal successors, (2376), 4 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:44,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 594.0) internal successors, (2376), 4 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:44,751 INFO L175 Difference]: Start difference. First operand has 161 places, 194 transitions, 406 flow. Second operand 3 states and 1060 transitions. [2023-08-29 03:02:44,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 472 flow [2023-08-29 03:02:44,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:02:44,754 INFO L231 Difference]: Finished difference. Result has 164 places, 105 transitions, 232 flow [2023-08-29 03:02:44,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=164, PETRI_TRANSITIONS=105} [2023-08-29 03:02:44,754 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2023-08-29 03:02:44,754 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 105 transitions, 232 flow [2023-08-29 03:02:44,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:44,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:44,754 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:44,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 03:02:44,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:02:44,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2037448912, now seen corresponding path program 1 times [2023-08-29 03:02:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138783109] [2023-08-29 03:02:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138783109] [2023-08-29 03:02:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138783109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:02:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463836595] [2023-08-29 03:02:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:44,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:02:44,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:02:44,781 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:02:44,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 03:02:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:44,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:02:44,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:02:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:44,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:02:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463836595] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:02:44,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:02:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:02:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621507434] [2023-08-29 03:02:44,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:02:44,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:02:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:02:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:02:44,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 594 [2023-08-29 03:02:44,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 105 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 321.7142857142857) internal successors, (2252), 7 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:44,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:44,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 594 [2023-08-29 03:02:44,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:45,283 INFO L130 PetriNetUnfolder]: 2338/5891 cut-off events. [2023-08-29 03:02:45,283 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-29 03:02:45,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5891 events. 2338/5891 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 48258 event pairs, 2193 based on Foata normal form. 0/5246 useless extension candidates. Maximal degree in co-relation 9538. Up to 3567 conditions per place. [2023-08-29 03:02:45,304 INFO L137 encePairwiseOnDemand]: 591/594 looper letters, 41 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-08-29 03:02:45,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 336 flow [2023-08-29 03:02:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:02:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:02:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1969 transitions. [2023-08-29 03:02:45,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524691358024691 [2023-08-29 03:02:45,306 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1969 transitions. [2023-08-29 03:02:45,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1969 transitions. [2023-08-29 03:02:45,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:45,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1969 transitions. [2023-08-29 03:02:45,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 328.1666666666667) internal successors, (1969), 6 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:45,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 594.0) internal successors, (4158), 7 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:45,310 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 594.0) internal successors, (4158), 7 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:45,310 INFO L175 Difference]: Start difference. First operand has 164 places, 105 transitions, 232 flow. Second operand 6 states and 1969 transitions. [2023-08-29 03:02:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 336 flow [2023-08-29 03:02:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 108 transitions, 330 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 03:02:45,313 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 262 flow [2023-08-29 03:02:45,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2023-08-29 03:02:45,313 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -45 predicate places. [2023-08-29 03:02:45,313 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 262 flow [2023-08-29 03:02:45,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 321.7142857142857) internal successors, (2252), 7 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:45,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:45,314 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:02:45,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 03:02:45,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-29 03:02:45,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:02:45,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash 215328572, now seen corresponding path program 2 times [2023-08-29 03:02:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162021625] [2023-08-29 03:02:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162021625] [2023-08-29 03:02:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162021625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:02:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962552603] [2023-08-29 03:02:45,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:02:45,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:02:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:02:45,577 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:02:45,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-29 03:02:45,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 03:02:45,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:02:45,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:02:45,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:02:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:45,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:02:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:02:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962552603] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:02:45,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:02:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 03:02:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472228816] [2023-08-29 03:02:45,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:02:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 03:02:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 03:02:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 03:02:45,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 594 [2023-08-29 03:02:45,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 262 flow. Second operand has 13 states, 13 states have (on average 321.38461538461536) internal successors, (4178), 13 states have internal predecessors, (4178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:45,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:45,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 594 [2023-08-29 03:02:45,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:02:46,188 INFO L130 PetriNetUnfolder]: 2338/5897 cut-off events. [2023-08-29 03:02:46,188 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-29 03:02:46,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9578 conditions, 5897 events. 2338/5897 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 48271 event pairs, 2193 based on Foata normal form. 6/5259 useless extension candidates. Maximal degree in co-relation 9519. Up to 3567 conditions per place. [2023-08-29 03:02:46,209 INFO L137 encePairwiseOnDemand]: 591/594 looper letters, 41 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2023-08-29 03:02:46,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 114 transitions, 402 flow [2023-08-29 03:02:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 03:02:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 03:02:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3898 transitions. [2023-08-29 03:02:46,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5468574635241302 [2023-08-29 03:02:46,212 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3898 transitions. [2023-08-29 03:02:46,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3898 transitions. [2023-08-29 03:02:46,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:02:46,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3898 transitions. [2023-08-29 03:02:46,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 324.8333333333333) internal successors, (3898), 12 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:46,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 594.0) internal successors, (7722), 13 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:46,219 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 594.0) internal successors, (7722), 13 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:46,219 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 262 flow. Second operand 12 states and 3898 transitions. [2023-08-29 03:02:46,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 114 transitions, 402 flow [2023-08-29 03:02:46,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 114 transitions, 388 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:02:46,221 INFO L231 Difference]: Finished difference. Result has 132 places, 114 transitions, 332 flow [2023-08-29 03:02:46,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=132, PETRI_TRANSITIONS=114} [2023-08-29 03:02:46,222 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -29 predicate places. [2023-08-29 03:02:46,222 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 114 transitions, 332 flow [2023-08-29 03:02:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 321.38461538461536) internal successors, (4178), 13 states have internal predecessors, (4178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:46,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:46,222 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:02:46,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 03:02:46,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 03:02:46,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:02:46,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1854504636, now seen corresponding path program 3 times [2023-08-29 03:02:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600053862] [2023-08-29 03:02:46,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:02:46,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 03:02:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:02:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 03:02:46,459 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 03:02:46,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 03:02:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 03:02:46,460 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 03:02:46,460 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 03:02:46,460 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 03:02:46,460 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 03:02:46,500 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 03:02:46,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,598 INFO L130 PetriNetUnfolder]: 110/907 cut-off events. [2023-08-29 03:02:46,598 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-29 03:02:46,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 907 events. 110/907 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4958 event pairs, 1 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 627. Up to 16 conditions per place. [2023-08-29 03:02:46,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,630 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:02:46,630 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,630 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:02:46,765 INFO L130 PetriNetUnfolder]: 110/907 cut-off events. [2023-08-29 03:02:46,765 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-29 03:02:46,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 907 events. 110/907 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4958 event pairs, 1 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 627. Up to 16 conditions per place. [2023-08-29 03:02:46,836 INFO L119 LiptonReduction]: Number of co-enabled transitions 141024 [2023-08-29 03:02:50,402 INFO L134 LiptonReduction]: Checked pairs total: 570703 [2023-08-29 03:02:50,402 INFO L136 LiptonReduction]: Total number of compositions: 291 [2023-08-29 03:02:50,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:02:50,403 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b84b63f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:02:50,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-29 03:02:50,408 INFO L130 PetriNetUnfolder]: 14/73 cut-off events. [2023-08-29 03:02:50,408 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 03:02:50,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:02:50,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:02:50,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-08-29 03:02:50,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:02:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 518680513, now seen corresponding path program 1 times [2023-08-29 03:02:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:02:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133558724] [2023-08-29 03:02:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:02:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:02:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:02:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:02:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:02:50,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133558724] [2023-08-29 03:02:50,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133558724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:02:50,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:02:50,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:02:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452990976] [2023-08-29 03:02:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:02:50,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:02:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:02:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:02:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:02:50,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 768 [2023-08-29 03:02:50,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 251 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:02:50,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:02:50,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 768 [2023-08-29 03:02:50,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand