./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_24-sound_lock_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_24-sound_lock_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 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --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 02:49:51,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:49:51,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:49:52,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:49:52,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:49:52,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:49:52,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:49:52,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:49:52,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:49:52,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:49:52,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:49:52,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:49:52,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:49:52,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:49:52,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:49:52,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:49:52,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:49:52,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:49:52,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:49:52,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:49:52,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:49:52,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:49:52,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:49:52,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:49:52,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:49:52,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:49:52,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:49:52,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:49:52,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:49:52,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:49:52,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:49:52,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:49:52,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:49:52,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:49:52,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:49:52,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:49:52,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:49:52,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:49:52,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:49:52,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:49:52,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:49:52,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 02:49:52,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:49:52,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:49:52,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:49:52,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:49:52,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:49:52,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:49:52,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:49:52,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:49:52,130 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:49:52,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:49:52,131 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:49:52,131 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:49:52,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:49:52,133 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:49:52,133 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:49:52,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:49:52,133 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:49:52,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:49:52,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:49:52,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:49:52,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:49:52,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:49:52,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:49:52,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:49:52,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:49:52,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:49:52,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:49:52,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:49:52,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:49:52,136 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:49:52,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:49:52,136 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:49:52,137 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 -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 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 02:49:52,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:49:52,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:49:52,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:49:52,440 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:49:52,441 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:49:52,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_24-sound_lock_racing.i [2023-08-29 02:49:53,585 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:49:53,862 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:49:53,863 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_24-sound_lock_racing.i [2023-08-29 02:49:53,873 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711c55d8e/defc1fb18c0140b1b094cfd87c4e2636/FLAG7ef321140 [2023-08-29 02:49:53,884 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711c55d8e/defc1fb18c0140b1b094cfd87c4e2636 [2023-08-29 02:49:53,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:49:53,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:49:53,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:49:53,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:49:53,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:49:53,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:49:53" (1/1) ... [2023-08-29 02:49:53,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551e80e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:53, skipping insertion in model container [2023-08-29 02:49:53,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:49:53" (1/1) ... [2023-08-29 02:49:53,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:49:53,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:49:54,285 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_24-sound_lock_racing.i[30176,30189] [2023-08-29 02:49:54,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:49:54,326 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:49:54,369 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_24-sound_lock_racing.i[30176,30189] [2023-08-29 02:49:54,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:49:54,437 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:49:54,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54 WrapperNode [2023-08-29 02:49:54,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:49:54,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:49:54,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:49:54,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:49:54,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,503 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-08-29 02:49:54,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:49:54,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:49:54,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:49:54,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:49:54,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,547 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:49:54,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:49:54,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:49:54,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:49:54,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (1/1) ... [2023-08-29 02:49:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:49:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:49:54,598 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 02:49:54,601 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 02:49:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:49:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:49:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:49:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:49:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:49:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:49:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:49:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:49:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 02:49:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:49:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:49:54,637 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 02:49:54,784 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:49:54,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:49:55,048 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:49:55,055 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:49:55,055 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-29 02:49:55,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:49:55 BoogieIcfgContainer [2023-08-29 02:49:55,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:49:55,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:49:55,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:49:55,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:49:55,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:49:53" (1/3) ... [2023-08-29 02:49:55,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e7d57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:49:55, skipping insertion in model container [2023-08-29 02:49:55,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:49:54" (2/3) ... [2023-08-29 02:49:55,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e7d57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:49:55, skipping insertion in model container [2023-08-29 02:49:55,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:49:55" (3/3) ... [2023-08-29 02:49:55,065 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2023-08-29 02:49:55,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:49:55,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:49:55,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-29 02:49:55,081 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:49:55,173 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 02:49:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,324 INFO L130 PetriNetUnfolder]: 18/179 cut-off events. [2023-08-29 02:49:55,325 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:49:55,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 179 events. 18/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 485 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:49:55,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,341 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:49:55,353 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,360 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 138 transitions, 284 flow [2023-08-29 02:49:55,404 INFO L130 PetriNetUnfolder]: 18/179 cut-off events. [2023-08-29 02:49:55,405 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:49:55,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 179 events. 18/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 485 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:49:55,409 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:49:58,963 INFO L134 LiptonReduction]: Checked pairs total: 11019 [2023-08-29 02:49:58,964 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-29 02:49:58,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:49:58,993 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:49:58,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 02:49:58,998 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-08-29 02:49:58,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:49:58,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:58,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:49:59,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:49:59,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 15801210, now seen corresponding path program 1 times [2023-08-29 02:49:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989216225] [2023-08-29 02:49:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:59,202 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 02:49:59,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989216225] [2023-08-29 02:49:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989216225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:49:59,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:49:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:49:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120760659] [2023-08-29 02:49:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:49:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 02:49:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 02:49:59,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 02:49:59,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 244 [2023-08-29 02:49:59,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 49 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 02:49:59,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:49:59,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 244 [2023-08-29 02:49:59,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:49:59,308 INFO L130 PetriNetUnfolder]: 121/369 cut-off events. [2023-08-29 02:49:59,309 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:49:59,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 369 events. 121/369 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1703 event pairs, 120 based on Foata normal form. 36/359 useless extension candidates. Maximal degree in co-relation 614. Up to 276 conditions per place. [2023-08-29 02:49:59,312 INFO L137 encePairwiseOnDemand]: 234/244 looper letters, 24 selfloop transitions, 0 changer transitions 2/39 dead transitions. [2023-08-29 02:49:59,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 138 flow [2023-08-29 02:49:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 02:49:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 02:49:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 284 transitions. [2023-08-29 02:49:59,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5819672131147541 [2023-08-29 02:49:59,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 284 transitions. [2023-08-29 02:49:59,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 284 transitions. [2023-08-29 02:49:59,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:49:59,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 284 transitions. [2023-08-29 02:49:59,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 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 02:49:59,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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 02:49:59,334 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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 02:49:59,335 INFO L175 Difference]: Start difference. First operand has 42 places, 49 transitions, 106 flow. Second operand 2 states and 284 transitions. [2023-08-29 02:49:59,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 138 flow [2023-08-29 02:49:59,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:49:59,340 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 79 flow [2023-08-29 02:49:59,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=79, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-29 02:49:59,344 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 02:49:59,344 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 79 flow [2023-08-29 02:49:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 02:49:59,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:59,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:49:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:49:59,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:49:59,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 489796081, now seen corresponding path program 1 times [2023-08-29 02:49:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866359044] [2023-08-29 02:49:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:59,413 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 02:49:59,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:59,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866359044] [2023-08-29 02:49:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866359044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:49:59,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:49:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:49:59,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880865973] [2023-08-29 02:49:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:49:59,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:49:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:49:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:49:59,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-08-29 02:49:59,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 02:49:59,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:49:59,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-08-29 02:49:59,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:49:59,542 INFO L130 PetriNetUnfolder]: 227/558 cut-off events. [2023-08-29 02:49:59,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:49:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 558 events. 227/558 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2577 event pairs, 83 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 1074. Up to 312 conditions per place. [2023-08-29 02:49:59,546 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 42 selfloop transitions, 6 changer transitions 3/56 dead transitions. [2023-08-29 02:49:59,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 219 flow [2023-08-29 02:49:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:49:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:49:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-29 02:49:59,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2023-08-29 02:49:59,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-29 02:49:59,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-29 02:49:59,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:49:59,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-29 02:49:59,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 02:49:59,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:49:59,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:49:59,554 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 79 flow. Second operand 3 states and 393 transitions. [2023-08-29 02:49:59,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 219 flow [2023-08-29 02:49:59,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:49:59,556 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 117 flow [2023-08-29 02:49:59,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-29 02:49:59,557 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 02:49:59,557 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 117 flow [2023-08-29 02:49:59,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 02:49:59,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:59,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:49:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 02:49:59,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:49:59,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 121576108, now seen corresponding path program 1 times [2023-08-29 02:49:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940109832] [2023-08-29 02:49:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:59,617 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 02:49:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940109832] [2023-08-29 02:49:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940109832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:49:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:49:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:49:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484881493] [2023-08-29 02:49:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:49:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:49:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:49:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:49:59,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-08-29 02:49:59,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 02:49:59,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:49:59,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-08-29 02:49:59,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:49:59,733 INFO L130 PetriNetUnfolder]: 228/558 cut-off events. [2023-08-29 02:49:59,733 INFO L131 PetriNetUnfolder]: For 114/116 co-relation queries the response was YES. [2023-08-29 02:49:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 558 events. 228/558 cut-off events. For 114/116 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2555 event pairs, 167 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 1223. Up to 439 conditions per place. [2023-08-29 02:49:59,737 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 41 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-29 02:49:59,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 237 flow [2023-08-29 02:49:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:49:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:49:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-29 02:49:59,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300546448087432 [2023-08-29 02:49:59,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-29 02:49:59,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-29 02:49:59,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:49:59,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-29 02:49:59,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 02:49:59,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:49:59,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:49:59,745 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 117 flow. Second operand 3 states and 388 transitions. [2023-08-29 02:49:59,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 237 flow [2023-08-29 02:49:59,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:49:59,749 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 137 flow [2023-08-29 02:49:59,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-29 02:49:59,751 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 02:49:59,751 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 137 flow [2023-08-29 02:49:59,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 02:49:59,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:59,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:49:59,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 02:49:59,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:49:59,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1753522542, now seen corresponding path program 1 times [2023-08-29 02:49:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963103654] [2023-08-29 02:49:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:59,996 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 02:49:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:59,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963103654] [2023-08-29 02:49:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963103654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:49:59,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:49:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 02:49:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260379050] [2023-08-29 02:49:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:49:59,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 02:49:59,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 02:49:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:50:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-08-29 02:50:00,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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 02:50:00,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:00,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-08-29 02:50:00,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:00,177 INFO L130 PetriNetUnfolder]: 116/349 cut-off events. [2023-08-29 02:50:00,177 INFO L131 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2023-08-29 02:50:00,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 349 events. 116/349 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1478 event pairs, 29 based on Foata normal form. 18/317 useless extension candidates. Maximal degree in co-relation 760. Up to 151 conditions per place. [2023-08-29 02:50:00,181 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 30 selfloop transitions, 7 changer transitions 7/53 dead transitions. [2023-08-29 02:50:00,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 237 flow [2023-08-29 02:50:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:50:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:50:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-29 02:50:00,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133196721311475 [2023-08-29 02:50:00,184 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-29 02:50:00,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-29 02:50:00,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:00,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-29 02:50:00,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 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 02:50:00,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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 02:50:00,193 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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 02:50:00,193 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 137 flow. Second operand 4 states and 501 transitions. [2023-08-29 02:50:00,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 237 flow [2023-08-29 02:50:00,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 217 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 02:50:00,197 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 109 flow [2023-08-29 02:50:00,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-29 02:50:00,199 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 02:50:00,199 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 109 flow [2023-08-29 02:50:00,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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 02:50:00,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:00,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:00,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 02:50:00,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:50:00,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash -298403855, now seen corresponding path program 1 times [2023-08-29 02:50:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989807784] [2023-08-29 02:50:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:00,252 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 02:50:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989807784] [2023-08-29 02:50:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989807784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975075799] [2023-08-29 02:50:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:00,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:00,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:00,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-08-29 02:50:00,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 02:50:00,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:00,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-08-29 02:50:00,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:00,328 INFO L130 PetriNetUnfolder]: 103/285 cut-off events. [2023-08-29 02:50:00,328 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-29 02:50:00,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 285 events. 103/285 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1072 event pairs, 85 based on Foata normal form. 11/250 useless extension candidates. Maximal degree in co-relation 686. Up to 248 conditions per place. [2023-08-29 02:50:00,329 INFO L137 encePairwiseOnDemand]: 242/244 looper letters, 0 selfloop transitions, 0 changer transitions 38/38 dead transitions. [2023-08-29 02:50:00,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 190 flow [2023-08-29 02:50:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 02:50:00,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136612021857924 [2023-08-29 02:50:00,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 02:50:00,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 02:50:00,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:00,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 02:50:00,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 02:50:00,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:50:00,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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 02:50:00,335 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 109 flow. Second operand 3 states and 376 transitions. [2023-08-29 02:50:00,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 190 flow [2023-08-29 02:50:00,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:50:00,337 INFO L231 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2023-08-29 02:50:00,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2023-08-29 02:50:00,337 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-29 02:50:00,338 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2023-08-29 02:50:00,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 02:50:00,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-08-29 02:50:00,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-08-29 02:50:00,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-08-29 02:50:00,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-08-29 02:50:00,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-08-29 02:50:00,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-08-29 02:50:00,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-08-29 02:50:00,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-08-29 02:50:00,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-08-29 02:50:00,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-08-29 02:50:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 02:50:00,353 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-29 02:50:00,355 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:50:00,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 138 transitions, 284 flow [2023-08-29 02:50:00,372 INFO L130 PetriNetUnfolder]: 18/179 cut-off events. [2023-08-29 02:50:00,372 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:50:00,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 179 events. 18/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 485 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:50:00,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 138 transitions, 284 flow [2023-08-29 02:50:00,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 133 transitions, 271 flow [2023-08-29 02:50:00,374 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:50:00,374 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 133 transitions, 271 flow [2023-08-29 02:50:00,375 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 133 transitions, 271 flow [2023-08-29 02:50:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 133 transitions, 271 flow [2023-08-29 02:50:00,386 INFO L130 PetriNetUnfolder]: 17/174 cut-off events. [2023-08-29 02:50:00,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:50:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 17/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 484 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:50:00,389 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:50:03,676 INFO L134 LiptonReduction]: Checked pairs total: 11799 [2023-08-29 02:50:03,676 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-29 02:50:03,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:50:03,679 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:50:03,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:50:03,682 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2023-08-29 02:50:03,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:50:03,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:03,683 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 02:50:03,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:50:03,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1113030033, now seen corresponding path program 1 times [2023-08-29 02:50:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108960396] [2023-08-29 02:50:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:50:03,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:50:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:50:03,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:50:03,753 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:50:03,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:50:03,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:50:03,754 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:50:03,755 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:50:03,755 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:50:03,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 02:50:03,786 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 02:50:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,826 INFO L130 PetriNetUnfolder]: 32/296 cut-off events. [2023-08-29 02:50:03,827 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:50:03,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 296 events. 32/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 971 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-08-29 02:50:03,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,833 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:50:03,833 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:03,862 INFO L130 PetriNetUnfolder]: 32/296 cut-off events. [2023-08-29 02:50:03,862 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:50:03,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 296 events. 32/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 971 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-08-29 02:50:03,871 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:50:07,316 INFO L134 LiptonReduction]: Checked pairs total: 50350 [2023-08-29 02:50:07,316 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-29 02:50:07,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:50:07,318 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:50:07,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-08-29 02:50:07,326 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:50:07,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:50:07,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:07,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:50:07,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:07,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 29870397, now seen corresponding path program 1 times [2023-08-29 02:50:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970302488] [2023-08-29 02:50:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:07,346 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 02:50:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970302488] [2023-08-29 02:50:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970302488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:07,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631575177] [2023-08-29 02:50:07,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:07,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 02:50:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 02:50:07,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 02:50:07,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 306 [2023-08-29 02:50:07,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 186 flow. Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 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 02:50:07,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:07,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 306 [2023-08-29 02:50:07,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:07,835 INFO L130 PetriNetUnfolder]: 2473/5304 cut-off events. [2023-08-29 02:50:07,835 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-29 02:50:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9366 conditions, 5304 events. 2473/5304 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 41095 event pairs, 2460 based on Foata normal form. 657/5222 useless extension candidates. Maximal degree in co-relation 6191. Up to 3992 conditions per place. [2023-08-29 02:50:07,864 INFO L137 encePairwiseOnDemand]: 290/306 looper letters, 36 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-29 02:50:07,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 226 flow [2023-08-29 02:50:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 02:50:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 02:50:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 376 transitions. [2023-08-29 02:50:07,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6143790849673203 [2023-08-29 02:50:07,866 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 376 transitions. [2023-08-29 02:50:07,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 376 transitions. [2023-08-29 02:50:07,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:07,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 376 transitions. [2023-08-29 02:50:07,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 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 02:50:07,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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 02:50:07,869 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 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 02:50:07,869 INFO L175 Difference]: Start difference. First operand has 72 places, 84 transitions, 186 flow. Second operand 2 states and 376 transitions. [2023-08-29 02:50:07,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 226 flow [2023-08-29 02:50:07,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:50:07,872 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 154 flow [2023-08-29 02:50:07,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2023-08-29 02:50:07,873 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-08-29 02:50:07,874 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 154 flow [2023-08-29 02:50:07,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 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 02:50:07,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:07,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:50:07,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:50:07,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:07,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 925926858, now seen corresponding path program 1 times [2023-08-29 02:50:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121220499] [2023-08-29 02:50:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:07,897 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 02:50:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121220499] [2023-08-29 02:50:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121220499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435173714] [2023-08-29 02:50:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:07,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 306 [2023-08-29 02:50:07,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 02:50:07,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:07,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 306 [2023-08-29 02:50:07,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:09,403 INFO L130 PetriNetUnfolder]: 10626/18818 cut-off events. [2023-08-29 02:50:09,403 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2023-08-29 02:50:09,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36083 conditions, 18818 events. 10626/18818 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 142779 event pairs, 4061 based on Foata normal form. 0/16694 useless extension candidates. Maximal degree in co-relation 36078. Up to 9351 conditions per place. [2023-08-29 02:50:09,524 INFO L137 encePairwiseOnDemand]: 287/306 looper letters, 83 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2023-08-29 02:50:09,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 449 flow [2023-08-29 02:50:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2023-08-29 02:50:09,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2023-08-29 02:50:09,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2023-08-29 02:50:09,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2023-08-29 02:50:09,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:09,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2023-08-29 02:50:09,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 02:50:09,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:09,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:09,531 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 154 flow. Second operand 3 states and 531 transitions. [2023-08-29 02:50:09,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 449 flow [2023-08-29 02:50:09,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:50:09,537 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 276 flow [2023-08-29 02:50:09,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2023-08-29 02:50:09,539 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-08-29 02:50:09,539 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 276 flow [2023-08-29 02:50:09,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 02:50:09,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:09,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 02:50:09,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:09,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 151811155, now seen corresponding path program 1 times [2023-08-29 02:50:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623379100] [2023-08-29 02:50:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:09,577 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 02:50:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623379100] [2023-08-29 02:50:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623379100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584015274] [2023-08-29 02:50:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:09,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:09,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 306 [2023-08-29 02:50:09,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 02:50:09,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:09,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 306 [2023-08-29 02:50:09,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:11,003 INFO L130 PetriNetUnfolder]: 9262/17023 cut-off events. [2023-08-29 02:50:11,004 INFO L131 PetriNetUnfolder]: For 5403/5458 co-relation queries the response was YES. [2023-08-29 02:50:11,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38515 conditions, 17023 events. 9262/17023 cut-off events. For 5403/5458 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 133988 event pairs, 6801 based on Foata normal form. 0/14843 useless extension candidates. Maximal degree in co-relation 38508. Up to 13730 conditions per place. [2023-08-29 02:50:11,178 INFO L137 encePairwiseOnDemand]: 298/306 looper letters, 73 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2023-08-29 02:50:11,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 554 flow [2023-08-29 02:50:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2023-08-29 02:50:11,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5664488017429193 [2023-08-29 02:50:11,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2023-08-29 02:50:11,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2023-08-29 02:50:11,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:11,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2023-08-29 02:50:11,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 02:50:11,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:11,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:11,185 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 276 flow. Second operand 3 states and 520 transitions. [2023-08-29 02:50:11,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 554 flow [2023-08-29 02:50:11,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:50:11,202 INFO L231 Difference]: Finished difference. Result has 77 places, 93 transitions, 353 flow [2023-08-29 02:50:11,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=77, PETRI_TRANSITIONS=93} [2023-08-29 02:50:11,203 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-29 02:50:11,203 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 353 flow [2023-08-29 02:50:11,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 02:50:11,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:11,204 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 02:50:11,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:11,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1407046194, now seen corresponding path program 1 times [2023-08-29 02:50:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887579624] [2023-08-29 02:50:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:11,237 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 02:50:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887579624] [2023-08-29 02:50:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887579624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753440168] [2023-08-29 02:50:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:11,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:11,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 306 [2023-08-29 02:50:11,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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 02:50:11,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:11,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 306 [2023-08-29 02:50:11,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:12,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([788] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][84], [172#true, 37#L712-4true, Black: 175#true, 181#true, 41#L702-17true, t_funThread1of2ForFork0InUse, Black: 183#(= |t_funThread1of2ForFork0_#t~nondet6| |#race~global~0|), 134#L702-18true, 186#true, t_funThread2of2ForFork0InUse]) [2023-08-29 02:50:12,178 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:50:12,178 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:50:12,178 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:50:12,178 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:50:12,752 INFO L130 PetriNetUnfolder]: 9770/17882 cut-off events. [2023-08-29 02:50:12,752 INFO L131 PetriNetUnfolder]: For 7724/8025 co-relation queries the response was YES. [2023-08-29 02:50:12,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41827 conditions, 17882 events. 9770/17882 cut-off events. For 7724/8025 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 141486 event pairs, 6789 based on Foata normal form. 13/15398 useless extension candidates. Maximal degree in co-relation 41819. Up to 14640 conditions per place. [2023-08-29 02:50:12,855 INFO L137 encePairwiseOnDemand]: 298/306 looper letters, 78 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-29 02:50:12,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 634 flow [2023-08-29 02:50:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-08-29 02:50:12,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5620915032679739 [2023-08-29 02:50:12,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-08-29 02:50:12,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-08-29 02:50:12,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:12,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-08-29 02:50:12,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 02:50:12,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:12,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:12,862 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 353 flow. Second operand 3 states and 516 transitions. [2023-08-29 02:50:12,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 634 flow [2023-08-29 02:50:12,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:50:12,895 INFO L231 Difference]: Finished difference. Result has 79 places, 104 transitions, 459 flow [2023-08-29 02:50:12,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=79, PETRI_TRANSITIONS=104} [2023-08-29 02:50:12,896 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-08-29 02:50:12,897 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 104 transitions, 459 flow [2023-08-29 02:50:12,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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 02:50:12,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:12,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:12,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 02:50:12,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:12,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1139353944, now seen corresponding path program 1 times [2023-08-29 02:50:12,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927503869] [2023-08-29 02:50:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:12,960 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 02:50:12,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927503869] [2023-08-29 02:50:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927503869] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:50:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465105609] [2023-08-29 02:50:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:12,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:50:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:50:12,969 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 02:50:12,995 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 02:50:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:13,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:50:13,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:50:13,170 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 02:50:13,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:50:13,202 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 02:50:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465105609] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:50:13,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:50:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-29 02:50:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230201602] [2023-08-29 02:50:13,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:50:13,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:50:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:50:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:50:13,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 306 [2023-08-29 02:50:13,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 104 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 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 02:50:13,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:13,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 306 [2023-08-29 02:50:13,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:13,472 INFO L130 PetriNetUnfolder]: 1136/2426 cut-off events. [2023-08-29 02:50:13,472 INFO L131 PetriNetUnfolder]: For 1690/1853 co-relation queries the response was YES. [2023-08-29 02:50:13,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 2426 events. 1136/2426 cut-off events. For 1690/1853 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 16669 event pairs, 170 based on Foata normal form. 52/2361 useless extension candidates. Maximal degree in co-relation 5939. Up to 1379 conditions per place. [2023-08-29 02:50:13,490 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 73 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-08-29 02:50:13,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 658 flow [2023-08-29 02:50:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 02:50:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 02:50:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2023-08-29 02:50:13,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2023-08-29 02:50:13,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2023-08-29 02:50:13,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2023-08-29 02:50:13,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:13,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2023-08-29 02:50:13,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 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 02:50:13,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 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 02:50:13,500 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 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 02:50:13,500 INFO L175 Difference]: Start difference. First operand has 79 places, 104 transitions, 459 flow. Second operand 5 states and 846 transitions. [2023-08-29 02:50:13,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 658 flow [2023-08-29 02:50:13,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 121 transitions, 640 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 02:50:13,506 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 340 flow [2023-08-29 02:50:13,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2023-08-29 02:50:13,508 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-08-29 02:50:13,508 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 340 flow [2023-08-29 02:50:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 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 02:50:13,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:13,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:13,519 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 02:50:13,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-29 02:50:13,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:13,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash 749580225, now seen corresponding path program 1 times [2023-08-29 02:50:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962456679] [2023-08-29 02:50:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:50:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:13,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962456679] [2023-08-29 02:50:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962456679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:50:13,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336882057] [2023-08-29 02:50:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:13,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:50:13,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:50:13,834 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 02:50:13,836 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 02:50:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:13,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 02:50:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:50:13,971 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 11 treesize of output 7 [2023-08-29 02:50:14,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:50:14,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 02:50:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:50:14,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:50:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336882057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:50:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-08-29 02:50:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350546129] [2023-08-29 02:50:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:14,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 02:50:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 02:50:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-29 02:50:14,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 306 [2023-08-29 02:50:14,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 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 02:50:14,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:14,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 306 [2023-08-29 02:50:14,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:14,203 INFO L130 PetriNetUnfolder]: 356/962 cut-off events. [2023-08-29 02:50:14,203 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2023-08-29 02:50:14,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 962 events. 356/962 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5088 event pairs, 108 based on Foata normal form. 84/1045 useless extension candidates. Maximal degree in co-relation 2193. Up to 482 conditions per place. [2023-08-29 02:50:14,207 INFO L137 encePairwiseOnDemand]: 297/306 looper letters, 27 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-08-29 02:50:14,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 257 flow [2023-08-29 02:50:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:50:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:50:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2023-08-29 02:50:14,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511437908496732 [2023-08-29 02:50:14,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 626 transitions. [2023-08-29 02:50:14,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 626 transitions. [2023-08-29 02:50:14,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:14,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 626 transitions. [2023-08-29 02:50:14,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 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 02:50:14,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 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 02:50:14,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 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 02:50:14,215 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 340 flow. Second operand 4 states and 626 transitions. [2023-08-29 02:50:14,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 257 flow [2023-08-29 02:50:14,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 208 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-08-29 02:50:14,218 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 129 flow [2023-08-29 02:50:14,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-29 02:50:14,219 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-29 02:50:14,219 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 129 flow [2023-08-29 02:50:14,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 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 02:50:14,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:14,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:14,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 02:50:14,432 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,SelfDestructingSolverStorable11 [2023-08-29 02:50:14,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:14,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash 114337898, now seen corresponding path program 1 times [2023-08-29 02:50:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071529572] [2023-08-29 02:50:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:14,462 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 02:50:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071529572] [2023-08-29 02:50:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071529572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301859311] [2023-08-29 02:50:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:14,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:14,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 306 [2023-08-29 02:50:14,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 02:50:14,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:14,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 306 [2023-08-29 02:50:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:14,578 INFO L130 PetriNetUnfolder]: 401/937 cut-off events. [2023-08-29 02:50:14,580 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-29 02:50:14,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 937 events. 401/937 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4566 event pairs, 363 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1992. Up to 696 conditions per place. [2023-08-29 02:50:14,584 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 31 selfloop transitions, 2 changer transitions 4/53 dead transitions. [2023-08-29 02:50:14,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 222 flow [2023-08-29 02:50:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-29 02:50:14,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261437908496732 [2023-08-29 02:50:14,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-29 02:50:14,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-29 02:50:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:14,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-29 02:50:14,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 02:50:14,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:14,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:14,590 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 129 flow. Second operand 3 states and 483 transitions. [2023-08-29 02:50:14,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 222 flow [2023-08-29 02:50:14,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:50:14,592 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 115 flow [2023-08-29 02:50:14,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-29 02:50:14,594 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2023-08-29 02:50:14,594 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 115 flow [2023-08-29 02:50:14,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 02:50:14,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:14,595 INFO L208 CegarLoopForPetriNet]: trace histogram [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 02:50:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 02:50:14,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:50:14,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1875906880, now seen corresponding path program 1 times [2023-08-29 02:50:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286182740] [2023-08-29 02:50:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:14,623 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 02:50:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286182740] [2023-08-29 02:50:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286182740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:14,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:14,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062152102] [2023-08-29 02:50:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:14,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 306 [2023-08-29 02:50:14,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 02:50:14,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:14,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 306 [2023-08-29 02:50:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:14,740 INFO L130 PetriNetUnfolder]: 292/705 cut-off events. [2023-08-29 02:50:14,740 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2023-08-29 02:50:14,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 705 events. 292/705 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3304 event pairs, 276 based on Foata normal form. 15/709 useless extension candidates. Maximal degree in co-relation 1478. Up to 543 conditions per place. [2023-08-29 02:50:14,742 INFO L137 encePairwiseOnDemand]: 304/306 looper letters, 0 selfloop transitions, 0 changer transitions 47/47 dead transitions. [2023-08-29 02:50:14,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 187 flow [2023-08-29 02:50:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:50:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:50:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-29 02:50:14,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217864923747276 [2023-08-29 02:50:14,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-29 02:50:14,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-29 02:50:14,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:14,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-29 02:50:14,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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 02:50:14,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:14,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 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 02:50:14,750 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 115 flow. Second operand 3 states and 479 transitions. [2023-08-29 02:50:14,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 187 flow [2023-08-29 02:50:14,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:50:14,752 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2023-08-29 02:50:14,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2023-08-29 02:50:14,753 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2023-08-29 02:50:14,754 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2023-08-29 02:50:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 02:50:14,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2023-08-29 02:50:14,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-08-29 02:50:14,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-08-29 02:50:14,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-08-29 02:50:14,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-08-29 02:50:14,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-08-29 02:50:14,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-08-29 02:50:14,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-08-29 02:50:14,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-08-29 02:50:14,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-08-29 02:50:14,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-08-29 02:50:14,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-08-29 02:50:14,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-08-29 02:50:14,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-08-29 02:50:14,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 02:50:14,757 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:50:14,758 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:50:14,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,856 INFO L130 PetriNetUnfolder]: 32/296 cut-off events. [2023-08-29 02:50:14,856 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:50:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 296 events. 32/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 971 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-08-29 02:50:14,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,859 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:50:14,859 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,860 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 184 transitions, 386 flow [2023-08-29 02:50:14,883 INFO L130 PetriNetUnfolder]: 32/296 cut-off events. [2023-08-29 02:50:14,884 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:50:14,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 296 events. 32/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 971 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-08-29 02:50:14,892 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:50:18,235 INFO L134 LiptonReduction]: Checked pairs total: 45099 [2023-08-29 02:50:18,235 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-29 02:50:18,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:50:18,238 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:50:18,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:50:18,243 INFO L130 PetriNetUnfolder]: 8/67 cut-off events. [2023-08-29 02:50:18,243 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 02:50:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:18,244 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 02:50:18,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:50:18,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -316725172, now seen corresponding path program 1 times [2023-08-29 02:50:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321118170] [2023-08-29 02:50:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:50:18,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:50:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:50:18,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:50:18,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:50:18,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:50:18,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:50:18,285 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:50:18,286 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:50:18,286 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:50:18,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 02:50:18,314 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 02:50:18,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,356 INFO L130 PetriNetUnfolder]: 51/456 cut-off events. [2023-08-29 02:50:18,356 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:50:18,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 456 events. 51/456 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1706 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 304. Up to 16 conditions per place. [2023-08-29 02:50:18,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,363 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:50:18,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,364 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:50:18,404 INFO L130 PetriNetUnfolder]: 51/456 cut-off events. [2023-08-29 02:50:18,404 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:50:18,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 456 events. 51/456 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1706 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 304. Up to 16 conditions per place. [2023-08-29 02:50:18,423 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:50:22,135 INFO L134 LiptonReduction]: Checked pairs total: 110195 [2023-08-29 02:50:22,136 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-08-29 02:50:22,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:50:22,138 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:50:22,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-29 02:50:22,139 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-29 02:50:22,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:50:22,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:22,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:50:22,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:50:22,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 46554202, now seen corresponding path program 1 times [2023-08-29 02:50:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084900534] [2023-08-29 02:50:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:22,159 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 02:50:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084900534] [2023-08-29 02:50:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084900534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108815489] [2023-08-29 02:50:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:22,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 02:50:22,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 02:50:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 02:50:22,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 375 [2023-08-29 02:50:22,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 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 02:50:22,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:22,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 375 [2023-08-29 02:50:22,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:27,004 INFO L130 PetriNetUnfolder]: 43368/73883 cut-off events. [2023-08-29 02:50:27,004 INFO L131 PetriNetUnfolder]: For 1385/1385 co-relation queries the response was YES. [2023-08-29 02:50:27,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135559 conditions, 73883 events. 43368/73883 cut-off events. For 1385/1385 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 682457 event pairs, 43211 based on Foata normal form. 10311/75800 useless extension candidates. Maximal degree in co-relation 56571. Up to 60661 conditions per place. [2023-08-29 02:50:27,640 INFO L137 encePairwiseOnDemand]: 353/375 looper letters, 48 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2023-08-29 02:50:27,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 312 flow [2023-08-29 02:50:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 02:50:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 02:50:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 470 transitions. [2023-08-29 02:50:27,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2023-08-29 02:50:27,644 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 470 transitions. [2023-08-29 02:50:27,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 470 transitions. [2023-08-29 02:50:27,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:50:27,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 470 transitions. [2023-08-29 02:50:27,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 235.0) internal successors, (470), 2 states have internal predecessors, (470), 0 states have call successors, (0), 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 02:50:27,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 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 02:50:27,648 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 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 02:50:27,648 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 260 flow. Second operand 2 states and 470 transitions. [2023-08-29 02:50:27,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 312 flow [2023-08-29 02:50:27,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 312 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:50:27,651 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 216 flow [2023-08-29 02:50:27,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2023-08-29 02:50:27,652 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-29 02:50:27,652 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 216 flow [2023-08-29 02:50:27,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 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 02:50:27,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:50:27,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:50:27,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:50:27,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:50:27,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:50:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1443098378, now seen corresponding path program 1 times [2023-08-29 02:50:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:50:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226859381] [2023-08-29 02:50:27,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:50:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:50:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:50:27,674 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 02:50:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:50:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226859381] [2023-08-29 02:50:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226859381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:50:27,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:50:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:50:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092870225] [2023-08-29 02:50:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:50:27,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:50:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:50:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:50:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:50:27,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 375 [2023-08-29 02:50:27,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 02:50:27,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:50:27,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 375 [2023-08-29 02:50:27,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:50:57,101 INFO L130 PetriNetUnfolder]: 329691/496638 cut-off events. [2023-08-29 02:50:57,101 INFO L131 PetriNetUnfolder]: For 5531/5531 co-relation queries the response was YES. [2023-08-29 02:50:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961971 conditions, 496638 events. 329691/496638 cut-off events. For 5531/5531 co-relation queries the response was YES. Maximal size of possible extension queue 8580. Compared 4479852 event pairs, 134481 based on Foata normal form. 0/443234 useless extension candidates. Maximal degree in co-relation 961965. Up to 244802 conditions per place. [2023-08-29 02:51:00,079 INFO L137 encePairwiseOnDemand]: 348/375 looper letters, 111 selfloop transitions, 20 changer transitions 0/154 dead transitions. [2023-08-29 02:51:00,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 154 transitions, 621 flow [2023-08-29 02:51:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2023-08-29 02:51:00,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.584 [2023-08-29 02:51:00,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 657 transitions. [2023-08-29 02:51:00,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 657 transitions. [2023-08-29 02:51:00,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:00,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 657 transitions. [2023-08-29 02:51:00,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 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 02:51:00,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:51:00,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:51:00,086 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 216 flow. Second operand 3 states and 657 transitions. [2023-08-29 02:51:00,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 154 transitions, 621 flow [2023-08-29 02:51:00,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 154 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:51:00,093 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 390 flow [2023-08-29 02:51:00,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2023-08-29 02:51:00,094 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2023-08-29 02:51:00,094 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 390 flow [2023-08-29 02:51:00,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 02:51:00,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:00,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:00,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:51:00,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:00,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -569940649, now seen corresponding path program 1 times [2023-08-29 02:51:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650794213] [2023-08-29 02:51:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:00,120 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 02:51:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650794213] [2023-08-29 02:51:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650794213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:00,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242848942] [2023-08-29 02:51:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:00,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:51:00,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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 02:51:00,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:00,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:51:00,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:30,627 INFO L130 PetriNetUnfolder]: 296568/459020 cut-off events. [2023-08-29 02:51:30,627 INFO L131 PetriNetUnfolder]: For 193564/196076 co-relation queries the response was YES. [2023-08-29 02:51:32,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078662 conditions, 459020 events. 296568/459020 cut-off events. For 193564/196076 co-relation queries the response was YES. Maximal size of possible extension queue 9414. Compared 4373269 event pairs, 198898 based on Foata normal form. 72/402070 useless extension candidates. Maximal degree in co-relation 1078654. Up to 359727 conditions per place. [2023-08-29 02:51:33,953 INFO L137 encePairwiseOnDemand]: 362/375 looper letters, 100 selfloop transitions, 22 changer transitions 0/165 dead transitions. [2023-08-29 02:51:33,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 165 transitions, 810 flow [2023-08-29 02:51:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2023-08-29 02:51:33,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2023-08-29 02:51:33,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2023-08-29 02:51:33,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2023-08-29 02:51:33,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:33,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2023-08-29 02:51:33,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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 02:51:33,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:51:33,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:51:33,959 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 390 flow. Second operand 3 states and 650 transitions. [2023-08-29 02:51:33,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 165 transitions, 810 flow [2023-08-29 02:51:34,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 165 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:34,621 INFO L231 Difference]: Finished difference. Result has 104 places, 133 transitions, 556 flow [2023-08-29 02:51:34,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=104, PETRI_TRANSITIONS=133} [2023-08-29 02:51:34,621 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2023-08-29 02:51:34,621 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 133 transitions, 556 flow [2023-08-29 02:51:34,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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 02:51:34,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:34,622 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:34,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 02:51:34,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:34,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 818587932, now seen corresponding path program 1 times [2023-08-29 02:51:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705546398] [2023-08-29 02:51:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:34,658 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 02:51:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705546398] [2023-08-29 02:51:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705546398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625527228] [2023-08-29 02:51:34,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:34,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:51:34,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 133 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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 02:51:34,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:34,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:51:34,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:44,448 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 29#L712-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, 204#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:44,448 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:51:44,448 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:51:44,449 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:51:44,449 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:51:47,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [30#L691-2true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:47,083 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,083 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,083 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,083 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 32#L691true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 228#true, 222#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:47,305 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:47,305 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:51:48,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [38#L712-6true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:48,502 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:51:48,502 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:51:48,502 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:51:48,502 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:51:49,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 77#L702-17true, 213#true, 48#L714-14true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, Black: 216#true, 228#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:49,782 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event [2023-08-29 02:51:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:51:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:51:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:51:51,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 52#L714-9true, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:51,095 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,095 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,095 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,095 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 162#L702-4true, 77#L702-17true, 213#true, 103#ULTIMATE.startEXITtrue, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:51,124 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,124 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,124 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:51,124 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:51:57,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 29#L712-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 228#true, Black: 216#true, 222#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:57,608 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:51:57,608 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:51:57,608 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:51:57,608 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:51:58,434 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, t_funThread2of3ForFork0InUse, 30#L691-2true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:58,434 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,434 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,434 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,434 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,847 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 32#L691true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 228#true, Black: 216#true, 222#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:51:58,848 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,848 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,848 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:51:58,848 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:52:00,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, 38#L712-6true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 216#true, 228#true, 222#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:00,061 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is not cut-off event [2023-08-29 02:52:00,062 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:52:00,062 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:52:00,062 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:52:01,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 48#L714-14true, Black: 216#true, 228#true, 222#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:01,236 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is not cut-off event [2023-08-29 02:52:01,236 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:52:01,236 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:52:01,236 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:52:01,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 29#L712-4true, 77#L702-17true, 213#true, 64#L702-24true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:01,537 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:52:01,537 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:01,537 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:01,537 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:02,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 52#L714-9true, 228#true, 222#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:02,352 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,352 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,352 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,352 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [60#L702-18true, t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 77#L702-17true, 213#true, 103#ULTIMATE.startEXITtrue, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:02,414 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:52:02,907 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1261] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][99], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 213#true, 11#L702-28true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, 68#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, 178#L702-17true]) [2023-08-29 02:52:02,907 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:52:02,907 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:02,907 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:02,907 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:03,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 193#L702-28true, 29#L712-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, Black: 216#true, 228#true, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:03,958 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is not cut-off event [2023-08-29 02:52:03,958 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:52:03,958 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:52:03,958 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:52:03,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 29#L712-4true, 77#L702-17true, 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, 228#true, Black: 216#true, 150#t_funEXITtrue, t_funThread1of3ForFork0InUse]) [2023-08-29 02:52:03,959 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:52:03,959 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:03,959 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:03,959 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:04,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1261] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][99], [t_funThread2of3ForFork0InUse, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread3of3ForFork0InUse, 213#true, 134#t_funEXITtrue, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 222#true, Black: 216#true, 228#true, 68#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, 178#L702-17true]) [2023-08-29 02:52:04,074 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:52:04,074 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:04,074 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:04,074 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:12,094 INFO L130 PetriNetUnfolder]: 336822/518261 cut-off events. [2023-08-29 02:52:12,094 INFO L131 PetriNetUnfolder]: For 343092/354599 co-relation queries the response was YES. [2023-08-29 02:52:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299222 conditions, 518261 events. 336822/518261 cut-off events. For 343092/354599 co-relation queries the response was YES. Maximal size of possible extension queue 10724. Compared 4964665 event pairs, 207996 based on Foata normal form. 303/446099 useless extension candidates. Maximal degree in co-relation 1299213. Up to 409882 conditions per place. [2023-08-29 02:52:15,691 INFO L137 encePairwiseOnDemand]: 362/375 looper letters, 119 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2023-08-29 02:52:15,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 196 transitions, 1137 flow [2023-08-29 02:52:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2023-08-29 02:52:15,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5768888888888889 [2023-08-29 02:52:15,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2023-08-29 02:52:15,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2023-08-29 02:52:15,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:15,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2023-08-29 02:52:15,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 02:52:15,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:15,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:15,697 INFO L175 Difference]: Start difference. First operand has 104 places, 133 transitions, 556 flow. Second operand 3 states and 649 transitions. [2023-08-29 02:52:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 196 transitions, 1137 flow [2023-08-29 02:52:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 196 transitions, 1065 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:52:32,307 INFO L231 Difference]: Finished difference. Result has 106 places, 163 transitions, 870 flow [2023-08-29 02:52:32,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=106, PETRI_TRANSITIONS=163} [2023-08-29 02:52:32,307 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2023-08-29 02:52:32,307 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 163 transitions, 870 flow [2023-08-29 02:52:32,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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 02:52:32,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:32,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 02:52:32,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:32,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash -942057961, now seen corresponding path program 1 times [2023-08-29 02:52:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125045551] [2023-08-29 02:52:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:32,364 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 02:52:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125045551] [2023-08-29 02:52:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125045551] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:52:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329123753] [2023-08-29 02:52:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:52:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:52:32,368 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 02:52:32,369 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 02:52:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:32,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:52:32,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:52:32,530 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 02:52:32,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:52:32,547 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 02:52:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329123753] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:52:32,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:52:32,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-29 02:52:32,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96149172] [2023-08-29 02:52:32,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:52:32,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:52:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:52:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:52:32,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 375 [2023-08-29 02:52:32,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 163 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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 02:52:32,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:32,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 375 [2023-08-29 02:52:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:33,490 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:33,490 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,490 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,490 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,490 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 74#L702-4true, 228#true, Black: 216#true]) [2023-08-29 02:52:33,554 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,554 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,554 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,554 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:33,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, 7#L702-27true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:33,684 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 02:52:33,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:52:33,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:52:33,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:52:33,702 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 222#true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:33,702 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 02:52:33,702 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:52:33,702 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:52:33,702 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:52:33,702 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:52:33,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L702-17true, 83#L710-12true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true]) [2023-08-29 02:52:33,880 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:52:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:33,880 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:34,087 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L702-17true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:34,087 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:52:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:34,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 167#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true]) [2023-08-29 02:52:34,591 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:52:34,591 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:34,591 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:34,592 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:34,729 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, 33#L702-17true, 20#L702-18true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true, 204#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:34,729 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,729 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,729 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,729 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), 8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:34,743 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,744 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,744 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,744 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 24#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 7#L702-27true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,769 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,769 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,769 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,769 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 167#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,814 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,815 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 167#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:34,817 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 167#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:34,818 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,818 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,818 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,818 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true, 178#L702-17true]) [2023-08-29 02:52:34,838 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,838 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,838 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,838 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:52:34,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true, 178#L702-17true]) [2023-08-29 02:52:34,839 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,839 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,839 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,839 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:34,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 24#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true]) [2023-08-29 02:52:34,935 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,935 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,935 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,935 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 33#L702-17true, 20#L702-18true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true, 204#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:34,966 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,966 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,966 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,966 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 74#L702-4true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,973 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,973 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,973 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,973 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 74#L702-4true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,973 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,974 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,974 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,974 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,986 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,986 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,987 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,987 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,987 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:34,989 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,989 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,989 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,989 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:34,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), 8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:34,990 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,990 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,990 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:34,990 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,008 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,008 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,008 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,008 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 162#L702-4true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,008 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,008 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,009 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,009 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,016 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,016 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,016 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,016 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,017 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:52:35,017 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 222#true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,017 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,017 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,017 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,017 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 24#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 7#L702-27true, 228#true, Black: 216#true]) [2023-08-29 02:52:35,049 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 96#L702-8true, 7#L702-27true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,057 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:52:35,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 94#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:35,095 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,095 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,095 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,095 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,114 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,114 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,114 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,114 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true, 204#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:35,165 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:52:35,165 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:52:35,166 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:52:35,166 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:52:35,166 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 200#L702-22true, 179#L710-6true, Black: 218#(= |#race~global~0| 0), 228#true, 204#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:35,166 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,166 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,166 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,166 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,234 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 24#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:35,235 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,235 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,235 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,235 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, 7#L702-27true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,239 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,239 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,239 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,240 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:52:35,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 94#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:35,327 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 33#L702-17true, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 94#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:35,343 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:52:35,343 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:52:35,343 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:52:35,344 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:52:35,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 94#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:35,350 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,350 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,350 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,350 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L702-6-->L702-8: Formula: (= |v_#race~global~0_67| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_67|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 222#true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 96#L702-8true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:35,382 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,382 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,382 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,382 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:35,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 83#L710-12true, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:35,411 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,411 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,411 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,411 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,450 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 83#L710-12true, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:35,451 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,451 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,451 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,451 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,451 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][135], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 43#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, 116#L702-8true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:35,842 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,842 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,842 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,842 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:35,850 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:35,850 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,850 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,850 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,850 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,933 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:35,933 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,933 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,933 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,933 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,933 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 167#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:35,988 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,988 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,988 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:35,988 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:36,138 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 74#L702-4true, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:36,138 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 02:52:36,138 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:36,138 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:36,138 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:36,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1365] L702-8-->L702-10: Formula: (= |v_#race~global~0_71| |v_t_funThread2of3ForFork0_#t~nondet6_13|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_71|} OutVars{t_funThread2of3ForFork0_#t~post5=|v_t_funThread2of3ForFork0_#t~post5_9|, t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_71|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~post5][99], [60#L702-18true, 113#L702-21true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 145#L702-10true, 213#true, Black: 228#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 218#(= |#race~global~0| 0), 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|)]) [2023-08-29 02:52:36,260 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,260 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,260 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,260 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 43#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true]) [2023-08-29 02:52:36,372 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,372 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,372 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,373 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,434 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, 94#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:36,434 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true, 178#L702-17true]) [2023-08-29 02:52:36,454 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is not cut-off event [2023-08-29 02:52:36,454 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:52:36,454 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:52:36,454 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:52:36,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, 179#L710-6true, Black: 218#(= |#race~global~0| 0), 228#true, 178#L702-17true]) [2023-08-29 02:52:36,454 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,454 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,455 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,455 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:36,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 33#L702-17true, 20#L702-18true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:36,546 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,546 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,546 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,547 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 33#L702-17true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 43#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:36,547 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,547 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,548 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,548 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, 33#L702-17true, 20#L702-18true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:36,574 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,574 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,574 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,574 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1395] L702-15-->L702-17: Formula: (= |v_#race~global~0_79| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_79|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [60#L702-18true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 33#L702-17true, 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 43#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 216#true, 228#true]) [2023-08-29 02:52:36,575 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,575 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,575 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,575 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 43#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 179#L710-6true, Black: 216#true, 228#true]) [2023-08-29 02:52:36,585 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,585 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,585 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,585 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,605 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:36,605 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:52:36,606 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [60#L702-18true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 149#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, 179#L710-6true, Black: 218#(= |#race~global~0| 0), 228#true]) [2023-08-29 02:52:36,606 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,606 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:52:36,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 7#L702-27true, 228#true, Black: 216#true]) [2023-08-29 02:52:36,645 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,645 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,645 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,645 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:36,719 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:52:36,719 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:52:36,719 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:52:36,719 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:52:36,719 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 124#L702-27true, t_funThread3of3ForFork0InUse, 179#L710-6true, 200#L702-22true, Black: 218#(= |#race~global~0| 0), 228#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:36,719 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,719 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,719 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,720 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:36,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), 83#L710-12true, Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 228#true, Black: 216#true]) [2023-08-29 02:52:36,994 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:52:36,994 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:36,994 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:36,994 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:37,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 7#L702-27true, 228#true, Black: 216#true]) [2023-08-29 02:52:37,051 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:52:37,051 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:37,051 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:37,051 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:37,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1377] L702-19-->L702-21: Formula: (= |v_t_funThread3of3ForFork0_#t~post8_9| (+ v_~global~0_104 1)) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_104} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [113#L702-21true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, 166#L702-16true, 36#L702-21true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 179#L710-6true, 228#true, Black: 216#true]) [2023-08-29 02:52:37,153 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:52:37,154 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:37,154 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:37,154 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:37,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1376] L702-20-->L702-22: Formula: (= |v_#race~global~0_73| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_73|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [113#L702-21true, Black: 224#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 322#(< |ULTIMATE.start_main_~i~1#1| 10000), Black: 230#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 200#L702-22true, 179#L710-6true, Black: 218#(= |#race~global~0| 0), 228#true, 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:52:37,405 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:52:37,405 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:37,405 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:37,405 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:37,685 INFO L130 PetriNetUnfolder]: 43084/74590 cut-off events. [2023-08-29 02:52:37,685 INFO L131 PetriNetUnfolder]: For 81540/89238 co-relation queries the response was YES. [2023-08-29 02:52:37,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200204 conditions, 74590 events. 43084/74590 cut-off events. For 81540/89238 co-relation queries the response was YES. Maximal size of possible extension queue 2372. Compared 715938 event pairs, 6250 based on Foata normal form. 1270/69985 useless extension candidates. Maximal degree in co-relation 200194. Up to 43126 conditions per place. [2023-08-29 02:52:38,191 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 155 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2023-08-29 02:52:38,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 238 transitions, 1503 flow [2023-08-29 02:52:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:52:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:52:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1275 transitions. [2023-08-29 02:52:38,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-29 02:52:38,194 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1275 transitions. [2023-08-29 02:52:38,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1275 transitions. [2023-08-29 02:52:38,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:38,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1275 transitions. [2023-08-29 02:52:38,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 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 02:52:38,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 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 02:52:38,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 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 02:52:38,200 INFO L175 Difference]: Start difference. First operand has 106 places, 163 transitions, 870 flow. Second operand 6 states and 1275 transitions. [2023-08-29 02:52:38,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 238 transitions, 1503 flow [2023-08-29 02:52:38,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 238 transitions, 1413 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 02:52:38,286 INFO L231 Difference]: Finished difference. Result has 96 places, 139 transitions, 681 flow [2023-08-29 02:52:38,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=96, PETRI_TRANSITIONS=139} [2023-08-29 02:52:38,287 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2023-08-29 02:52:38,287 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 139 transitions, 681 flow [2023-08-29 02:52:38,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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 02:52:38,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:38,287 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:38,292 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 02:52:38,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:52:38,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:38,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash 700065427, now seen corresponding path program 1 times [2023-08-29 02:52:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:38,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828998234] [2023-08-29 02:52:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:38,525 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 02:52:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828998234] [2023-08-29 02:52:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828998234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:38,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879809102] [2023-08-29 02:52:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:38,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:38,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:52:38,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:52:38,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 139 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 02:52:38,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:38,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:52:38,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:44,868 INFO L130 PetriNetUnfolder]: 59330/94424 cut-off events. [2023-08-29 02:52:44,869 INFO L131 PetriNetUnfolder]: For 92531/96108 co-relation queries the response was YES. [2023-08-29 02:52:45,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259555 conditions, 94424 events. 59330/94424 cut-off events. For 92531/96108 co-relation queries the response was YES. Maximal size of possible extension queue 2462. Compared 808373 event pairs, 35299 based on Foata normal form. 207/86834 useless extension candidates. Maximal degree in co-relation 259545. Up to 73848 conditions per place. [2023-08-29 02:52:45,487 INFO L137 encePairwiseOnDemand]: 363/375 looper letters, 114 selfloop transitions, 38 changer transitions 0/191 dead transitions. [2023-08-29 02:52:45,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 191 transitions, 1235 flow [2023-08-29 02:52:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-08-29 02:52:45,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528888888888889 [2023-08-29 02:52:45,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-08-29 02:52:45,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-08-29 02:52:45,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:45,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-08-29 02:52:45,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 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 02:52:45,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:45,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:45,494 INFO L175 Difference]: Start difference. First operand has 96 places, 139 transitions, 681 flow. Second operand 3 states and 622 transitions. [2023-08-29 02:52:45,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 191 transitions, 1235 flow [2023-08-29 02:52:45,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 191 transitions, 1234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:52:45,510 INFO L231 Difference]: Finished difference. Result has 99 places, 169 transitions, 1082 flow [2023-08-29 02:52:45,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=99, PETRI_TRANSITIONS=169} [2023-08-29 02:52:45,511 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2023-08-29 02:52:45,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 169 transitions, 1082 flow [2023-08-29 02:52:45,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 02:52:45,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:45,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 02:52:45,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:45,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2079777816, now seen corresponding path program 1 times [2023-08-29 02:52:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998286818] [2023-08-29 02:52:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:52:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998286818] [2023-08-29 02:52:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998286818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:52:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375223152] [2023-08-29 02:52:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:52:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:52:45,609 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 02:52:45,638 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 02:52:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:45,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 02:52:45,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:52:45,738 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 11 treesize of output 7 [2023-08-29 02:52:45,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:52:45,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 02:52:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:52:45,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:52:45,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375223152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:45,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:52:45,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-08-29 02:52:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839416060] [2023-08-29 02:52:45,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:45,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 02:52:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 02:52:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-29 02:52:45,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 375 [2023-08-29 02:52:45,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 169 transitions, 1082 flow. Second operand has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 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 02:52:45,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:45,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 375 [2023-08-29 02:52:45,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:46,640 INFO L130 PetriNetUnfolder]: 3533/7931 cut-off events. [2023-08-29 02:52:46,640 INFO L131 PetriNetUnfolder]: For 5882/5882 co-relation queries the response was YES. [2023-08-29 02:52:46,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19374 conditions, 7931 events. 3533/7931 cut-off events. For 5882/5882 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 59612 event pairs, 908 based on Foata normal form. 1344/9275 useless extension candidates. Maximal degree in co-relation 19363. Up to 4431 conditions per place. [2023-08-29 02:52:46,668 INFO L137 encePairwiseOnDemand]: 362/375 looper letters, 40 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2023-08-29 02:52:46,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 82 transitions, 414 flow [2023-08-29 02:52:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:52:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:52:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 775 transitions. [2023-08-29 02:52:46,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-08-29 02:52:46,671 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 775 transitions. [2023-08-29 02:52:46,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 775 transitions. [2023-08-29 02:52:46,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:46,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 775 transitions. [2023-08-29 02:52:46,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 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 02:52:46,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 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 02:52:46,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 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 02:52:46,675 INFO L175 Difference]: Start difference. First operand has 99 places, 169 transitions, 1082 flow. Second operand 4 states and 775 transitions. [2023-08-29 02:52:46,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 82 transitions, 414 flow [2023-08-29 02:52:46,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 308 flow, removed 33 selfloop flow, removed 10 redundant places. [2023-08-29 02:52:46,700 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 188 flow [2023-08-29 02:52:46,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2023-08-29 02:52:46,700 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -15 predicate places. [2023-08-29 02:52:46,701 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 188 flow [2023-08-29 02:52:46,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 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 02:52:46,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:46,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:46,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-29 02:52:46,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:52:46,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:46,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash -480820704, now seen corresponding path program 1 times [2023-08-29 02:52:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676342118] [2023-08-29 02:52:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:46,933 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 02:52:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676342118] [2023-08-29 02:52:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676342118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:46,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004406902] [2023-08-29 02:52:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:46,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:52:46,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:52:46,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 02:52:46,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:46,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:52:46,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:47,389 INFO L130 PetriNetUnfolder]: 4018/7820 cut-off events. [2023-08-29 02:52:47,389 INFO L131 PetriNetUnfolder]: For 1406/1406 co-relation queries the response was YES. [2023-08-29 02:52:47,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16633 conditions, 7820 events. 4018/7820 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 52231 event pairs, 3750 based on Foata normal form. 0/7608 useless extension candidates. Maximal degree in co-relation 16626. Up to 6171 conditions per place. [2023-08-29 02:52:47,421 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 53 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-29 02:52:47,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 332 flow [2023-08-29 02:52:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2023-08-29 02:52:47,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342222222222223 [2023-08-29 02:52:47,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 601 transitions. [2023-08-29 02:52:47,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 601 transitions. [2023-08-29 02:52:47,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:47,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 601 transitions. [2023-08-29 02:52:47,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 02:52:47,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:47,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:47,426 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 188 flow. Second operand 3 states and 601 transitions. [2023-08-29 02:52:47,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 332 flow [2023-08-29 02:52:47,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:52:47,431 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 177 flow [2023-08-29 02:52:47,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2023-08-29 02:52:47,431 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -16 predicate places. [2023-08-29 02:52:47,432 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 177 flow [2023-08-29 02:52:47,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 02:52:47,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:47,432 INFO L208 CegarLoopForPetriNet]: trace histogram [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 02:52:47,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 02:52:47,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:47,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:47,433 INFO L85 PathProgramCache]: Analyzing trace with hash -313164511, now seen corresponding path program 1 times [2023-08-29 02:52:47,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:47,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678539570] [2023-08-29 02:52:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:47,463 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 02:52:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678539570] [2023-08-29 02:52:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678539570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:47,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433744016] [2023-08-29 02:52:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:52:47,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:52:47,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 02:52:47,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:47,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:52:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:47,974 INFO L130 PetriNetUnfolder]: 4018/7757 cut-off events. [2023-08-29 02:52:47,974 INFO L131 PetriNetUnfolder]: For 1367/1367 co-relation queries the response was YES. [2023-08-29 02:52:47,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 7757 events. 4018/7757 cut-off events. For 1367/1367 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 51162 event pairs, 3887 based on Foata normal form. 0/7545 useless extension candidates. Maximal degree in co-relation 16323. Up to 6404 conditions per place. [2023-08-29 02:52:47,992 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 47 selfloop transitions, 2 changer transitions 4/76 dead transitions. [2023-08-29 02:52:47,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 306 flow [2023-08-29 02:52:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2023-08-29 02:52:47,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-29 02:52:47,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 600 transitions. [2023-08-29 02:52:47,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions. [2023-08-29 02:52:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:47,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions. [2023-08-29 02:52:47,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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 02:52:47,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:47,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:47,996 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 177 flow. Second operand 3 states and 600 transitions. [2023-08-29 02:52:47,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 306 flow [2023-08-29 02:52:47,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:52:47,999 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 168 flow [2023-08-29 02:52:47,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2023-08-29 02:52:48,000 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -17 predicate places. [2023-08-29 02:52:48,000 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 168 flow [2023-08-29 02:52:48,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 02:52:48,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:48,001 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:48,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 02:52:48,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:52:48,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1510002482, now seen corresponding path program 1 times [2023-08-29 02:52:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955282803] [2023-08-29 02:52:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:48,036 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 02:52:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955282803] [2023-08-29 02:52:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955282803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654191923] [2023-08-29 02:52:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:48,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:52:48,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 375 [2023-08-29 02:52:48,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 02:52:48,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:48,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 375 [2023-08-29 02:52:48,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:48,369 INFO L130 PetriNetUnfolder]: 2816/5595 cut-off events. [2023-08-29 02:52:48,369 INFO L131 PetriNetUnfolder]: For 1120/1120 co-relation queries the response was YES. [2023-08-29 02:52:48,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11765 conditions, 5595 events. 2816/5595 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 36162 event pairs, 2706 based on Foata normal form. 75/5533 useless extension candidates. Maximal degree in co-relation 11758. Up to 4533 conditions per place. [2023-08-29 02:52:48,380 INFO L137 encePairwiseOnDemand]: 373/375 looper letters, 0 selfloop transitions, 0 changer transitions 70/70 dead transitions. [2023-08-29 02:52:48,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 276 flow [2023-08-29 02:52:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2023-08-29 02:52:48,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297777777777778 [2023-08-29 02:52:48,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2023-08-29 02:52:48,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2023-08-29 02:52:48,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:48,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2023-08-29 02:52:48,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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 02:52:48,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:48,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 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 02:52:48,384 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 168 flow. Second operand 3 states and 596 transitions. [2023-08-29 02:52:48,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 276 flow [2023-08-29 02:52:48,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:52:48,387 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2023-08-29 02:52:48,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2023-08-29 02:52:48,388 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2023-08-29 02:52:48,388 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2023-08-29 02:52:48,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 02:52:48,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2023-08-29 02:52:48,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-08-29 02:52:48,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-08-29 02:52:48,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-08-29 02:52:48,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-08-29 02:52:48,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-08-29 02:52:48,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 02:52:48,391 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:48,392 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 (1/2) [2023-08-29 02:52:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,432 INFO L130 PetriNetUnfolder]: 51/456 cut-off events. [2023-08-29 02:52:48,433 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:52:48,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 456 events. 51/456 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1706 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 304. Up to 16 conditions per place. [2023-08-29 02:52:48,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,439 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:52:48,439 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,440 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 230 transitions, 490 flow [2023-08-29 02:52:48,478 INFO L130 PetriNetUnfolder]: 51/456 cut-off events. [2023-08-29 02:52:48,479 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:52:48,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 456 events. 51/456 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1706 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 304. Up to 16 conditions per place. [2023-08-29 02:52:48,491 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:52:51,983 INFO L134 LiptonReduction]: Checked pairs total: 98023 [2023-08-29 02:52:51,983 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-29 02:52:51,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:52:51,984 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:52:51,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:52:51,990 INFO L130 PetriNetUnfolder]: 18/119 cut-off events. [2023-08-29 02:52:51,990 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 02:52:51,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:51,991 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 02:52:51,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:52:51,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2023083311, now seen corresponding path program 1 times [2023-08-29 02:52:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122579021] [2023-08-29 02:52:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:52:52,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:52:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:52:52,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:52:52,014 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:52:52,014 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:52:52,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 02:52:52,015 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:52:52,015 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:52:52,015 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:52:52,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 02:52:52,033 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 02:52:52,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,109 INFO L130 PetriNetUnfolder]: 82/704 cut-off events. [2023-08-29 02:52:52,109 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:52:52,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 704 events. 82/704 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2976 event pairs, 6 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-29 02:52:52,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,121 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:52:52,121 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,122 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 276 transitions, 596 flow [2023-08-29 02:52:52,175 INFO L130 PetriNetUnfolder]: 82/704 cut-off events. [2023-08-29 02:52:52,175 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:52:52,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 704 events. 82/704 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2976 event pairs, 6 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-29 02:52:52,205 INFO L119 LiptonReduction]: Number of co-enabled transitions 42768 [2023-08-29 02:52:55,857 INFO L134 LiptonReduction]: Checked pairs total: 166714 [2023-08-29 02:52:55,857 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-29 02:52:55,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:52:55,858 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;@607621ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:52:55,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-29 02:52:55,860 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:52:55,860 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:52:55,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:55,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:52:55,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 02:52:55,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 65857661, now seen corresponding path program 1 times [2023-08-29 02:52:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790259277] [2023-08-29 02:52:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:55,882 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 02:52:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790259277] [2023-08-29 02:52:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790259277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045589117] [2023-08-29 02:52:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 02:52:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 02:52:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 02:52:55,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 437 [2023-08-29 02:52:55,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 336 flow. Second operand has 2 states, 2 states have (on average 240.0) internal successors, (480), 2 states have internal predecessors, (480), 0 states have call successors, (0), 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 02:52:55,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:55,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 437 [2023-08-29 02:52:55,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:21,707 INFO L130 PetriNetUnfolder]: 667681/992301 cut-off events. [2023-08-29 02:54:21,708 INFO L131 PetriNetUnfolder]: For 25040/25040 co-relation queries the response was YES. [2023-08-29 02:54:26,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871728 conditions, 992301 events. 667681/992301 cut-off events. For 25040/25040 co-relation queries the response was YES. Maximal size of possible extension queue 19245. Compared 9842980 event pairs, 665796 based on Foata normal form. 202563/1102182 useless extension candidates. Maximal degree in co-relation 332854. Up to 864824 conditions per place. [2023-08-29 02:54:31,805 INFO L137 encePairwiseOnDemand]: 409/437 looper letters, 60 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-08-29 02:54:31,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 400 flow [2023-08-29 02:54:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 02:54:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 02:54:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 564 transitions. [2023-08-29 02:54:31,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6453089244851259 [2023-08-29 02:54:31,825 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 564 transitions. [2023-08-29 02:54:31,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 564 transitions. [2023-08-29 02:54:31,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:31,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 564 transitions. [2023-08-29 02:54:31,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 282.0) internal successors, (564), 2 states have internal predecessors, (564), 0 states have call successors, (0), 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 02:54:31,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 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 02:54:31,828 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 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 02:54:31,840 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 336 flow. Second operand 2 states and 564 transitions. [2023-08-29 02:54:31,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 400 flow [2023-08-29 02:54:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:54:31,851 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 280 flow [2023-08-29 02:54:31,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=280, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2023-08-29 02:54:31,852 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 0 predicate places. [2023-08-29 02:54:31,852 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 280 flow [2023-08-29 02:54:31,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 240.0) internal successors, (480), 2 states have internal predecessors, (480), 0 states have call successors, (0), 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 02:54:31,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:31,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:54:31,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 02:54:31,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 02:54:31,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2041496562, now seen corresponding path program 1 times [2023-08-29 02:54:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092642531] [2023-08-29 02:54:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:31,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:31,888 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 02:54:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092642531] [2023-08-29 02:54:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092642531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:31,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:54:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823136541] [2023-08-29 02:54:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:54:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:54:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:54:31,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 437 [2023-08-29 02:54:31,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 02:54:31,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:31,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 437 [2023-08-29 02:54:31,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand