./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_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_01-simple_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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --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:40:01,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:40:01,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:40:01,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:40:01,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:40:01,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:40:01,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:40:01,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:40:01,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:40:01,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:40:01,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:40:01,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:40:01,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:40:01,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:40:01,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:40:01,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:40:01,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:40:01,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:40:01,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:40:01,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:40:01,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:40:01,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:40:01,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:40:01,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:40:01,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:40:01,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:40:01,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:40:01,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:40:01,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:40:01,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:40:01,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:40:01,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:40:01,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:40:01,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:40:01,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:40:01,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:40:01,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:40:01,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:40:01,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:40:01,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:40:01,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:40:01,426 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:40:01,456 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:40:01,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:40:01,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:40:01,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:40:01,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:40:01,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:40:01,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:40:01,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:40:01,459 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:40:01,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:40:01,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:40:01,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:40:01,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:40:01,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:40:01,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:40:01,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:40:01,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:40:01,463 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:40:01,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:40:01,463 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:40:01,463 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 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:40:01,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:40:01,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:40:01,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:40:01,764 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:40:01,765 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:40:01,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2023-08-29 02:40:02,715 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:40:02,948 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:40:02,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2023-08-29 02:40:02,960 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81f6217b/a3390ea32e794effaef03b8055954e23/FLAGab4e52add [2023-08-29 02:40:02,970 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81f6217b/a3390ea32e794effaef03b8055954e23 [2023-08-29 02:40:02,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:40:02,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:40:02,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:40:02,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:40:02,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:40:02,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:40:02" (1/1) ... [2023-08-29 02:40:02,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751f4dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:02, skipping insertion in model container [2023-08-29 02:40:02,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:40:02" (1/1) ... [2023-08-29 02:40:02,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:40:03,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:40:03,190 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_01-simple_racing.i[30176,30189] [2023-08-29 02:40:03,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:40:03,231 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:40:03,273 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_01-simple_racing.i[30176,30189] [2023-08-29 02:40:03,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:40:03,305 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:40:03,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03 WrapperNode [2023-08-29 02:40:03,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:40:03,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:40:03,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:40:03,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:40:03,313 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:40:03" (1/1) ... [2023-08-29 02:40:03,338 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:40:03" (1/1) ... [2023-08-29 02:40:03,360 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2023-08-29 02:40:03,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:40:03,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:40:03,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:40:03,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:40:03,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,401 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:40:03,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:40:03,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:40:03,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:40:03,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (1/1) ... [2023-08-29 02:40:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:40:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:03,436 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:40:03,444 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:40:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:40:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:40:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:40:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:40:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:40:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:40:03,470 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:40:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:40:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 02:40:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:40:03,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:40:03,471 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:40:03,625 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:40:03,626 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:40:03,816 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:40:03,822 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:40:03,822 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-29 02:40:03,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:40:03 BoogieIcfgContainer [2023-08-29 02:40:03,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:40:03,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:40:03,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:40:03,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:40:03,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:40:02" (1/3) ... [2023-08-29 02:40:03,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa2d85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:40:03, skipping insertion in model container [2023-08-29 02:40:03,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:03" (2/3) ... [2023-08-29 02:40:03,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa2d85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:40:03, skipping insertion in model container [2023-08-29 02:40:03,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:40:03" (3/3) ... [2023-08-29 02:40:03,842 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2023-08-29 02:40:03,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:40:03,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:40:03,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-29 02:40:03,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:40:03,887 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 02:40:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:03,993 INFO L130 PetriNetUnfolder]: 17/171 cut-off events. [2023-08-29 02:40:03,993 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 171 events. 17/171 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 475 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:03,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:04,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:04,006 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:04,012 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:04,014 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:04,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:04,061 INFO L130 PetriNetUnfolder]: 17/171 cut-off events. [2023-08-29 02:40:04,062 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:04,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 171 events. 17/171 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 475 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:04,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:40:06,545 INFO L134 LiptonReduction]: Checked pairs total: 10766 [2023-08-29 02:40:06,545 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-29 02:40:06,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:06,561 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:06,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 02:40:06,564 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-08-29 02:40:06,564 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:06,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:06,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:06,565 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:40:06,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 14852946, now seen corresponding path program 1 times [2023-08-29 02:40:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28500828] [2023-08-29 02:40:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:06,749 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:40:06,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28500828] [2023-08-29 02:40:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28500828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:06,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:06,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942728749] [2023-08-29 02:40:06,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:06,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:06,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 225 [2023-08-29 02:40:06,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 49 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:40:06,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:06,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 225 [2023-08-29 02:40:06,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:06,904 INFO L130 PetriNetUnfolder]: 120/350 cut-off events. [2023-08-29 02:40:06,904 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 350 events. 120/350 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1583 event pairs, 99 based on Foata normal form. 48/355 useless extension candidates. Maximal degree in co-relation 603. Up to 255 conditions per place. [2023-08-29 02:40:06,907 INFO L137 encePairwiseOnDemand]: 212/225 looper letters, 35 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-29 02:40:06,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 190 flow [2023-08-29 02:40:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-29 02:40:06,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5807407407407408 [2023-08-29 02:40:06,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-29 02:40:06,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-29 02:40:06,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:06,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-29 02:40:06,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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:40:06,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:06,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:06,930 INFO L175 Difference]: Start difference. First operand has 42 places, 49 transitions, 106 flow. Second operand 3 states and 392 transitions. [2023-08-29 02:40:06,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 190 flow [2023-08-29 02:40:06,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:06,933 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 87 flow [2023-08-29 02:40:06,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-08-29 02:40:06,937 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 02:40:06,937 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 87 flow [2023-08-29 02:40:06,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:40:06,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:06,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:40:06,938 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:40:06,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1909389254, now seen corresponding path program 1 times [2023-08-29 02:40:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959987429] [2023-08-29 02:40:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:07,013 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:40:07,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959987429] [2023-08-29 02:40:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959987429] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665036305] [2023-08-29 02:40:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:07,026 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:40:07,030 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:40:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:07,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:07,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:07,122 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:40:07,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:40:07,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665036305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:07,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:40:07,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:40:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728548124] [2023-08-29 02:40:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:07,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:40:07,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2023-08-29 02:40:07,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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:40:07,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:07,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2023-08-29 02:40:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:07,258 INFO L130 PetriNetUnfolder]: 212/515 cut-off events. [2023-08-29 02:40:07,258 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 02:40:07,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 515 events. 212/515 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2383 event pairs, 74 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1028. Up to 292 conditions per place. [2023-08-29 02:40:07,261 INFO L137 encePairwiseOnDemand]: 216/225 looper letters, 40 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2023-08-29 02:40:07,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 226 flow [2023-08-29 02:40:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-29 02:40:07,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437037037037037 [2023-08-29 02:40:07,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-29 02:40:07,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-29 02:40:07,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:07,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-29 02:40:07,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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:40:07,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:07,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:07,281 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 87 flow. Second operand 3 states and 367 transitions. [2023-08-29 02:40:07,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 226 flow [2023-08-29 02:40:07,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:07,283 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 121 flow [2023-08-29 02:40:07,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=79, 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=121, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-29 02:40:07,283 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 02:40:07,283 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 121 flow [2023-08-29 02:40:07,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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:40:07,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:07,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:07,291 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:40:07,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:07,485 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:40:07,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -433714881, now seen corresponding path program 1 times [2023-08-29 02:40:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148208694] [2023-08-29 02:40:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:07,542 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:40:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148208694] [2023-08-29 02:40:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148208694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553441554] [2023-08-29 02:40:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:07,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:07,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 225 [2023-08-29 02:40:07,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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:40:07,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:07,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 225 [2023-08-29 02:40:07,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:07,646 INFO L130 PetriNetUnfolder]: 213/514 cut-off events. [2023-08-29 02:40:07,646 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-08-29 02:40:07,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 514 events. 213/514 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2359 event pairs, 154 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 1154. Up to 405 conditions per place. [2023-08-29 02:40:07,651 INFO L137 encePairwiseOnDemand]: 220/225 looper letters, 39 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-29 02:40:07,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 238 flow [2023-08-29 02:40:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-29 02:40:07,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362962962962963 [2023-08-29 02:40:07,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-29 02:40:07,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-29 02:40:07,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:07,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-29 02:40:07,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:40:07,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:07,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:07,660 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 121 flow. Second operand 3 states and 362 transitions. [2023-08-29 02:40:07,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 238 flow [2023-08-29 02:40:07,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:07,662 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 141 flow [2023-08-29 02:40:07,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=109, 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=141, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-29 02:40:07,662 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 02:40:07,663 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 141 flow [2023-08-29 02:40:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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:40:07,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:07,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:07,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 02:40:07,664 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:40:07,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1010678792, now seen corresponding path program 1 times [2023-08-29 02:40:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917560848] [2023-08-29 02:40:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:07,717 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:40:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917560848] [2023-08-29 02:40:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917560848] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362339536] [2023-08-29 02:40:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:07,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:07,721 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:40:07,723 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:40:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:07,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:07,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:07,817 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:40:07,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:40:07,837 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:40:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362339536] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:40:07,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:40:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:40:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703110362] [2023-08-29 02:40:07,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:40:07,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:40:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:40:07,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:40:07,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 225 [2023-08-29 02:40:07,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:07,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:07,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 225 [2023-08-29 02:40:07,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:07,895 INFO L130 PetriNetUnfolder]: 24/84 cut-off events. [2023-08-29 02:40:07,895 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2023-08-29 02:40:07,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 84 events. 24/84 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 14/98 useless extension candidates. Maximal degree in co-relation 160. Up to 50 conditions per place. [2023-08-29 02:40:07,896 INFO L137 encePairwiseOnDemand]: 222/225 looper letters, 21 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2023-08-29 02:40:07,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 163 flow [2023-08-29 02:40:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:40:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:40:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-29 02:40:07,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-08-29 02:40:07,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-29 02:40:07,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-29 02:40:07,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:07,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-29 02:40:07,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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:40:07,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 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:40:07,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 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:40:07,914 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 141 flow. Second operand 4 states and 474 transitions. [2023-08-29 02:40:07,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 163 flow [2023-08-29 02:40:07,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 135 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 02:40:07,916 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 49 flow [2023-08-29 02:40:07,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=49, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-29 02:40:07,917 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -13 predicate places. [2023-08-29 02:40:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 49 flow [2023-08-29 02:40:07,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:07,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:07,918 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:40:07,925 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:40:08,122 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,SelfDestructingSolverStorable3 [2023-08-29 02:40:08,124 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:40:08,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1351542072, now seen corresponding path program 1 times [2023-08-29 02:40:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875812129] [2023-08-29 02:40:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:08,160 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:40:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875812129] [2023-08-29 02:40:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875812129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654325816] [2023-08-29 02:40:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:08,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:08,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 225 [2023-08-29 02:40:08,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:40:08,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:08,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 225 [2023-08-29 02:40:08,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:08,204 INFO L130 PetriNetUnfolder]: 24/72 cut-off events. [2023-08-29 02:40:08,204 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 02:40:08,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 72 events. 24/72 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 22 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 143. Up to 61 conditions per place. [2023-08-29 02:40:08,205 INFO L137 encePairwiseOnDemand]: 223/225 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-29 02:40:08,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 89 flow [2023-08-29 02:40:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-29 02:40:08,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2023-08-29 02:40:08,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-29 02:40:08,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-29 02:40:08,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:08,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-29 02:40:08,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:40:08,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:08,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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:40:08,210 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 3 states and 340 transitions. [2023-08-29 02:40:08,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 89 flow [2023-08-29 02:40:08,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 85 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:08,214 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2023-08-29 02:40:08,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2023-08-29 02:40:08,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -17 predicate places. [2023-08-29 02:40:08,216 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2023-08-29 02:40:08,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:40:08,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-08-29 02:40:08,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-08-29 02:40:08,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-08-29 02:40:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-08-29 02:40:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-08-29 02:40:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-08-29 02:40:08,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-08-29 02:40:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-08-29 02:40:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-08-29 02:40:08,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-08-29 02:40:08,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 02:40:08,222 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-29 02:40:08,223 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:40:08,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:08,241 INFO L130 PetriNetUnfolder]: 17/171 cut-off events. [2023-08-29 02:40:08,241 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:08,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 171 events. 17/171 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 475 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:08,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 130 transitions, 268 flow [2023-08-29 02:40:08,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 125 transitions, 255 flow [2023-08-29 02:40:08,242 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:08,242 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 125 transitions, 255 flow [2023-08-29 02:40:08,243 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 125 transitions, 255 flow [2023-08-29 02:40:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 125 transitions, 255 flow [2023-08-29 02:40:08,251 INFO L130 PetriNetUnfolder]: 16/166 cut-off events. [2023-08-29 02:40:08,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 166 events. 16/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 479 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:08,252 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:40:10,563 INFO L134 LiptonReduction]: Checked pairs total: 10591 [2023-08-29 02:40:10,564 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-29 02:40:10,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:40:10,566 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:10,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:40:10,567 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2023-08-29 02:40:10,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:10,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:10,568 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 02:40:10,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:40:10,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash -195313517, now seen corresponding path program 1 times [2023-08-29 02:40:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885682315] [2023-08-29 02:40:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:10,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:40:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:10,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:40:10,597 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:40:10,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:40:10,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:40:10,598 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:40:10,598 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:40:10,599 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:40:10,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 02:40:10,612 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 02:40:10,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,630 INFO L130 PetriNetUnfolder]: 31/288 cut-off events. [2023-08-29 02:40:10,630 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:10,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 288 events. 31/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 948 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-29 02:40:10,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,633 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:10,633 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,634 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:10,669 INFO L130 PetriNetUnfolder]: 31/288 cut-off events. [2023-08-29 02:40:10,669 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:10,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 288 events. 31/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 948 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-29 02:40:10,678 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:40:12,979 INFO L134 LiptonReduction]: Checked pairs total: 44567 [2023-08-29 02:40:12,980 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-29 02:40:12,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:12,981 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:12,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-08-29 02:40:12,982 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:40:12,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:12,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:12,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:12,983 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:40:12,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash 27937110, now seen corresponding path program 1 times [2023-08-29 02:40:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84639834] [2023-08-29 02:40:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:13,005 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:40:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84639834] [2023-08-29 02:40:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84639834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:13,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759367843] [2023-08-29 02:40:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:13,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:13,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:13,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:13,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:13,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 287 [2023-08-29 02:40:13,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 186 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:40:13,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:13,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 287 [2023-08-29 02:40:13,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:13,362 INFO L130 PetriNetUnfolder]: 2472/5239 cut-off events. [2023-08-29 02:40:13,363 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 02:40:13,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9295 conditions, 5239 events. 2472/5239 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40337 event pairs, 2319 based on Foata normal form. 788/5318 useless extension candidates. Maximal degree in co-relation 6184. Up to 3973 conditions per place. [2023-08-29 02:40:13,379 INFO L137 encePairwiseOnDemand]: 268/287 looper letters, 46 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-29 02:40:13,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 274 flow [2023-08-29 02:40:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-08-29 02:40:13,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051103368176539 [2023-08-29 02:40:13,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-08-29 02:40:13,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-08-29 02:40:13,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:13,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-08-29 02:40:13,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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:40:13,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:13,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:13,385 INFO L175 Difference]: Start difference. First operand has 72 places, 84 transitions, 186 flow. Second operand 3 states and 521 transitions. [2023-08-29 02:40:13,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 274 flow [2023-08-29 02:40:13,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:13,388 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 166 flow [2023-08-29 02:40:13,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-29 02:40:13,389 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-08-29 02:40:13,389 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 166 flow [2023-08-29 02:40:13,389 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:40:13,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:13,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:13,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:40:13,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:40:13,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1705669057, now seen corresponding path program 1 times [2023-08-29 02:40:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586301942] [2023-08-29 02:40:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:13,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:40:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586301942] [2023-08-29 02:40:13,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586301942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:13,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:13,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532206920] [2023-08-29 02:40:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:13,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:13,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:13,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:13,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 287 [2023-08-29 02:40:13,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:40:13,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:13,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 287 [2023-08-29 02:40:13,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:14,423 INFO L130 PetriNetUnfolder]: 9946/17443 cut-off events. [2023-08-29 02:40:14,424 INFO L131 PetriNetUnfolder]: For 893/893 co-relation queries the response was YES. [2023-08-29 02:40:14,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34413 conditions, 17443 events. 9946/17443 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 130029 event pairs, 3677 based on Foata normal form. 0/15747 useless extension candidates. Maximal degree in co-relation 34307. Up to 8886 conditions per place. [2023-08-29 02:40:14,506 INFO L137 encePairwiseOnDemand]: 268/287 looper letters, 83 selfloop transitions, 14 changer transitions 0/114 dead transitions. [2023-08-29 02:40:14,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 468 flow [2023-08-29 02:40:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2023-08-29 02:40:14,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.586527293844367 [2023-08-29 02:40:14,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2023-08-29 02:40:14,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2023-08-29 02:40:14,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:14,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2023-08-29 02:40:14,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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:40:14,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:14,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:14,511 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 166 flow. Second operand 3 states and 505 transitions. [2023-08-29 02:40:14,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 468 flow [2023-08-29 02:40:14,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:14,515 INFO L231 Difference]: Finished difference. Result has 77 places, 83 transitions, 286 flow [2023-08-29 02:40:14,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=77, PETRI_TRANSITIONS=83} [2023-08-29 02:40:14,516 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-29 02:40:14,517 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 83 transitions, 286 flow [2023-08-29 02:40:14,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:40:14,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:14,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:14,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 02:40:14,517 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:40:14,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1034677099, now seen corresponding path program 1 times [2023-08-29 02:40:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:14,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122060173] [2023-08-29 02:40:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:14,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:14,541 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:40:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122060173] [2023-08-29 02:40:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122060173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991182321] [2023-08-29 02:40:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:14,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 287 [2023-08-29 02:40:14,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 83 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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:40:14,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:14,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 287 [2023-08-29 02:40:14,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:15,505 INFO L130 PetriNetUnfolder]: 8706/15893 cut-off events. [2023-08-29 02:40:15,506 INFO L131 PetriNetUnfolder]: For 5838/5867 co-relation queries the response was YES. [2023-08-29 02:40:15,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36699 conditions, 15893 events. 8706/15893 cut-off events. For 5838/5867 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 124820 event pairs, 6325 based on Foata normal form. 0/14015 useless extension candidates. Maximal degree in co-relation 16469. Up to 12994 conditions per place. [2023-08-29 02:40:15,569 INFO L137 encePairwiseOnDemand]: 279/287 looper letters, 73 selfloop transitions, 13 changer transitions 0/117 dead transitions. [2023-08-29 02:40:15,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 117 transitions, 570 flow [2023-08-29 02:40:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-29 02:40:15,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5737514518002322 [2023-08-29 02:40:15,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-29 02:40:15,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-29 02:40:15,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:15,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-29 02:40:15,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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:40:15,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:15,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:15,574 INFO L175 Difference]: Start difference. First operand has 77 places, 83 transitions, 286 flow. Second operand 3 states and 494 transitions. [2023-08-29 02:40:15,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 117 transitions, 570 flow [2023-08-29 02:40:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:15,584 INFO L231 Difference]: Finished difference. Result has 78 places, 94 transitions, 363 flow [2023-08-29 02:40:15,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=78, PETRI_TRANSITIONS=94} [2023-08-29 02:40:15,585 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2023-08-29 02:40:15,585 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 363 flow [2023-08-29 02:40:15,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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:40:15,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:15,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:15,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 02:40:15,586 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:40:15,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1218802657, now seen corresponding path program 1 times [2023-08-29 02:40:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288667995] [2023-08-29 02:40:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:15,619 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:40:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288667995] [2023-08-29 02:40:15,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288667995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:15,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21668239] [2023-08-29 02:40:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:15,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:15,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 287 [2023-08-29 02:40:15,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 363 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:40:15,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:15,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 287 [2023-08-29 02:40:15,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:16,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([736] 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], [t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 37#L702-17true, Black: 178#(= |t_funThread1of2ForFork0_#t~nondet6| |#race~global~0|), 181#true, Black: 167#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L702-18true, 176#true, 54#L709-4true, Black: 170#true]) [2023-08-29 02:40:16,217 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:40:16,217 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:16,218 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:16,218 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:16,580 INFO L130 PetriNetUnfolder]: 9189/16687 cut-off events. [2023-08-29 02:40:16,581 INFO L131 PetriNetUnfolder]: For 7999/8237 co-relation queries the response was YES. [2023-08-29 02:40:16,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39799 conditions, 16687 events. 9189/16687 cut-off events. For 7999/8237 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 131340 event pairs, 6315 based on Foata normal form. 5/14528 useless extension candidates. Maximal degree in co-relation 17543. Up to 13851 conditions per place. [2023-08-29 02:40:16,655 INFO L137 encePairwiseOnDemand]: 279/287 looper letters, 77 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-29 02:40:16,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 644 flow [2023-08-29 02:40:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-08-29 02:40:16,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2023-08-29 02:40:16,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-08-29 02:40:16,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-08-29 02:40:16,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:16,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-08-29 02:40:16,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 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:40:16,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:16,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:16,660 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 363 flow. Second operand 3 states and 490 transitions. [2023-08-29 02:40:16,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 644 flow [2023-08-29 02:40:16,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:16,667 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 469 flow [2023-08-29 02:40:16,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=80, PETRI_TRANSITIONS=105} [2023-08-29 02:40:16,668 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-08-29 02:40:16,668 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 469 flow [2023-08-29 02:40:16,668 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:40:16,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:16,668 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:40:16,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 02:40:16,669 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:40:16,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -541459449, now seen corresponding path program 1 times [2023-08-29 02:40:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369209754] [2023-08-29 02:40:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:16,703 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:40:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369209754] [2023-08-29 02:40:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369209754] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289401232] [2023-08-29 02:40:16,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:16,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:16,705 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:40:16,719 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:40:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:16,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:16,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:16,789 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:40:16,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:40:16,812 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:40:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289401232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:40:16,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:40:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:40:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205323699] [2023-08-29 02:40:16,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:40:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:40:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:40:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:40:16,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 287 [2023-08-29 02:40:16,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 469 flow. Second operand has 7 states, 7 states have (on average 151.85714285714286) internal successors, (1063), 7 states have internal predecessors, (1063), 0 states have call successors, (0), 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:40:16,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:16,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 287 [2023-08-29 02:40:16,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:17,066 INFO L130 PetriNetUnfolder]: 1136/2426 cut-off events. [2023-08-29 02:40:17,067 INFO L131 PetriNetUnfolder]: For 2032/2207 co-relation queries the response was YES. [2023-08-29 02:40:17,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6186 conditions, 2426 events. 1136/2426 cut-off events. For 2032/2207 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 16627 event pairs, 170 based on Foata normal form. 316/2626 useless extension candidates. Maximal degree in co-relation 2673. Up to 1379 conditions per place. [2023-08-29 02:40:17,074 INFO L137 encePairwiseOnDemand]: 284/287 looper letters, 73 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-08-29 02:40:17,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 121 transitions, 664 flow [2023-08-29 02:40:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 02:40:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 02:40:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2023-08-29 02:40:17,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2023-08-29 02:40:17,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 805 transitions. [2023-08-29 02:40:17,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 805 transitions. [2023-08-29 02:40:17,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:17,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 805 transitions. [2023-08-29 02:40:17,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 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:40:17,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 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:40:17,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 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:40:17,081 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 469 flow. Second operand 5 states and 805 transitions. [2023-08-29 02:40:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 121 transitions, 664 flow [2023-08-29 02:40:17,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 646 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:17,085 INFO L231 Difference]: Finished difference. Result has 70 places, 80 transitions, 346 flow [2023-08-29 02:40:17,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2023-08-29 02:40:17,086 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2023-08-29 02:40:17,086 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 346 flow [2023-08-29 02:40:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 151.85714285714286) internal successors, (1063), 7 states have internal predecessors, (1063), 0 states have call successors, (0), 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:40:17,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:17,086 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:40:17,103 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:40:17,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:17,292 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:40:17,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1594917312, now seen corresponding path program 1 times [2023-08-29 02:40:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452030406] [2023-08-29 02:40:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:17,435 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:40:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452030406] [2023-08-29 02:40:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452030406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:17,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 02:40:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564919989] [2023-08-29 02:40:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:17,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 02:40:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 02:40:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 02:40:17,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 287 [2023-08-29 02:40:17,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 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:40:17,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:17,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 287 [2023-08-29 02:40:17,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:17,540 INFO L130 PetriNetUnfolder]: 111/421 cut-off events. [2023-08-29 02:40:17,540 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2023-08-29 02:40:17,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 421 events. 111/421 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1804 event pairs, 12 based on Foata normal form. 54/475 useless extension candidates. Maximal degree in co-relation 555. Up to 234 conditions per place. [2023-08-29 02:40:17,541 INFO L137 encePairwiseOnDemand]: 282/287 looper letters, 25 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-29 02:40:17,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 247 flow [2023-08-29 02:40:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:40:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:40:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2023-08-29 02:40:17,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418118466898955 [2023-08-29 02:40:17,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2023-08-29 02:40:17,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2023-08-29 02:40:17,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:17,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2023-08-29 02:40:17,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 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:40:17,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 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:40:17,547 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 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:40:17,547 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 346 flow. Second operand 4 states and 622 transitions. [2023-08-29 02:40:17,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 247 flow [2023-08-29 02:40:17,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 188 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-08-29 02:40:17,548 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 121 flow [2023-08-29 02:40:17,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 02:40:17,549 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2023-08-29 02:40:17,549 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 121 flow [2023-08-29 02:40:17,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 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:40:17,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:17,550 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:40:17,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 02:40:17,550 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:40:17,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash -324777526, now seen corresponding path program 1 times [2023-08-29 02:40:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237066934] [2023-08-29 02:40:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:17,570 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:40:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237066934] [2023-08-29 02:40:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237066934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:17,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:17,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983690798] [2023-08-29 02:40:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:17,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:17,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 287 [2023-08-29 02:40:17,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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:40:17,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:17,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 287 [2023-08-29 02:40:17,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:17,637 INFO L130 PetriNetUnfolder]: 134/424 cut-off events. [2023-08-29 02:40:17,638 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2023-08-29 02:40:17,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 424 events. 134/424 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1727 event pairs, 120 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 341. Up to 291 conditions per place. [2023-08-29 02:40:17,638 INFO L137 encePairwiseOnDemand]: 284/287 looper letters, 30 selfloop transitions, 2 changer transitions 3/51 dead transitions. [2023-08-29 02:40:17,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 206 flow [2023-08-29 02:40:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-29 02:40:17,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5307781649245064 [2023-08-29 02:40:17,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-29 02:40:17,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-29 02:40:17,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:17,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-29 02:40:17,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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:40:17,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:17,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:17,644 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 121 flow. Second operand 3 states and 457 transitions. [2023-08-29 02:40:17,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 206 flow [2023-08-29 02:40:17,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:17,645 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 111 flow [2023-08-29 02:40:17,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=111, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-29 02:40:17,646 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-29 02:40:17,646 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 111 flow [2023-08-29 02:40:17,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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:40:17,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:17,646 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:40:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 02:40:17,647 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:40:17,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 361050282, now seen corresponding path program 1 times [2023-08-29 02:40:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373880382] [2023-08-29 02:40:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:17,671 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:40:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373880382] [2023-08-29 02:40:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373880382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708843925] [2023-08-29 02:40:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:17,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:17,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 287 [2023-08-29 02:40:17,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 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:40:17,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:17,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 287 [2023-08-29 02:40:17,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:17,732 INFO L130 PetriNetUnfolder]: 99/311 cut-off events. [2023-08-29 02:40:17,732 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-29 02:40:17,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 311 events. 99/311 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1167 event pairs, 95 based on Foata normal form. 6/314 useless extension candidates. Maximal degree in co-relation 396. Up to 230 conditions per place. [2023-08-29 02:40:17,732 INFO L137 encePairwiseOnDemand]: 285/287 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-29 02:40:17,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 175 flow [2023-08-29 02:40:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-29 02:40:17,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261324041811847 [2023-08-29 02:40:17,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-29 02:40:17,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-29 02:40:17,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:17,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-29 02:40:17,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:40:17,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:17,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 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:40:17,737 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 111 flow. Second operand 3 states and 453 transitions. [2023-08-29 02:40:17,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 175 flow [2023-08-29 02:40:17,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:17,738 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2023-08-29 02:40:17,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=53, PETRI_TRANSITIONS=0} [2023-08-29 02:40:17,739 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-29 02:40:17,739 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2023-08-29 02:40:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 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:40:17,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2023-08-29 02:40:17,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-08-29 02:40:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-08-29 02:40:17,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-08-29 02:40:17,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-08-29 02:40:17,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-08-29 02:40:17,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-08-29 02:40:17,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-08-29 02:40:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 02:40:17,741 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:17,742 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:40:17,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,757 INFO L130 PetriNetUnfolder]: 31/288 cut-off events. [2023-08-29 02:40:17,757 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 288 events. 31/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 948 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-29 02:40:17,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,759 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:17,759 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,759 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 176 transitions, 370 flow [2023-08-29 02:40:17,772 INFO L130 PetriNetUnfolder]: 31/288 cut-off events. [2023-08-29 02:40:17,772 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:17,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 288 events. 31/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 948 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-29 02:40:17,778 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:40:20,073 INFO L134 LiptonReduction]: Checked pairs total: 44369 [2023-08-29 02:40:20,074 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-29 02:40:20,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:40:20,075 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:20,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:40:20,079 INFO L130 PetriNetUnfolder]: 6/62 cut-off events. [2023-08-29 02:40:20,079 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 02:40:20,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:20,080 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 02:40:20,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:40:20,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1856194345, now seen corresponding path program 1 times [2023-08-29 02:40:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:20,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263624214] [2023-08-29 02:40:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:20,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:40:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:20,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:40:20,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:40:20,098 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:40:20,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:40:20,098 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:40:20,099 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:40:20,099 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:40:20,099 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 02:40:20,113 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 02:40:20,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,147 INFO L130 PetriNetUnfolder]: 50/448 cut-off events. [2023-08-29 02:40:20,147 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:40:20,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 448 events. 50/448 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2023-08-29 02:40:20,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,152 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:20,152 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,152 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:40:20,229 INFO L130 PetriNetUnfolder]: 50/448 cut-off events. [2023-08-29 02:40:20,230 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:40:20,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 448 events. 50/448 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2023-08-29 02:40:20,239 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:40:22,492 INFO L134 LiptonReduction]: Checked pairs total: 98321 [2023-08-29 02:40:22,492 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-29 02:40:22,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:22,493 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:22,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-29 02:40:22,494 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-29 02:40:22,494 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:22,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:22,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:22,495 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:40:22,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 43573340, now seen corresponding path program 1 times [2023-08-29 02:40:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408712206] [2023-08-29 02:40:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:22,509 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:40:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408712206] [2023-08-29 02:40:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408712206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263760662] [2023-08-29 02:40:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:22,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:22,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 351 [2023-08-29 02:40:22,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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:40:22,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:22,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 351 [2023-08-29 02:40:22,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:26,623 INFO L130 PetriNetUnfolder]: 43367/75200 cut-off events. [2023-08-29 02:40:26,623 INFO L131 PetriNetUnfolder]: For 1549/1549 co-relation queries the response was YES. [2023-08-29 02:40:26,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136975 conditions, 75200 events. 43367/75200 cut-off events. For 1549/1549 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 711519 event pairs, 28031 based on Foata normal form. 11777/78620 useless extension candidates. Maximal degree in co-relation 9408. Up to 60642 conditions per place. [2023-08-29 02:40:26,941 INFO L137 encePairwiseOnDemand]: 326/351 looper letters, 58 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2023-08-29 02:40:26,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 360 flow [2023-08-29 02:40:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2023-08-29 02:40:26,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6201329534662868 [2023-08-29 02:40:26,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 653 transitions. [2023-08-29 02:40:26,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 653 transitions. [2023-08-29 02:40:26,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:26,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 653 transitions. [2023-08-29 02:40:26,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 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:40:26,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:40:26,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:40:26,949 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 260 flow. Second operand 3 states and 653 transitions. [2023-08-29 02:40:26,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 360 flow [2023-08-29 02:40:26,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:26,952 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 228 flow [2023-08-29 02:40:26,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2023-08-29 02:40:26,952 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-08-29 02:40:26,952 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 228 flow [2023-08-29 02:40:26,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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:40:26,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:26,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:26,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:40:26,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:40:26,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1971527677, now seen corresponding path program 1 times [2023-08-29 02:40:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935207412] [2023-08-29 02:40:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:26,971 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:40:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935207412] [2023-08-29 02:40:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935207412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304794213] [2023-08-29 02:40:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:26,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:26,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:27,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 351 [2023-08-29 02:40:27,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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:40:27,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:27,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 351 [2023-08-29 02:40:27,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:51,364 INFO L130 PetriNetUnfolder]: 308262/462102 cut-off events. [2023-08-29 02:40:51,364 INFO L131 PetriNetUnfolder]: For 21376/21376 co-relation queries the response was YES. [2023-08-29 02:40:52,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914009 conditions, 462102 events. 308262/462102 cut-off events. For 21376/21376 co-relation queries the response was YES. Maximal size of possible extension queue 8043. Compared 4107190 event pairs, 124028 based on Foata normal form. 0/418305 useless extension candidates. Maximal degree in co-relation 913897. Up to 231260 conditions per place. [2023-08-29 02:40:53,647 INFO L137 encePairwiseOnDemand]: 324/351 looper letters, 111 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2023-08-29 02:40:53,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 155 transitions, 640 flow [2023-08-29 02:40:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-29 02:40:53,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5992402659069326 [2023-08-29 02:40:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-29 02:40:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-29 02:40:53,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:53,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-29 02:40:53,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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:40:53,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:40:53,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:40:53,652 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 228 flow. Second operand 3 states and 631 transitions. [2023-08-29 02:40:53,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 155 transitions, 640 flow [2023-08-29 02:40:53,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:53,666 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 400 flow [2023-08-29 02:40:53,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2023-08-29 02:40:53,667 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2023-08-29 02:40:53,667 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 400 flow [2023-08-29 02:40:53,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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:40:53,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:53,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:53,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:40:53,668 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:40:53,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1055373245, now seen corresponding path program 1 times [2023-08-29 02:40:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364704896] [2023-08-29 02:40:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:53,682 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:40:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364704896] [2023-08-29 02:40:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364704896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669924704] [2023-08-29 02:40:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:53,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:53,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:40:53,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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:40:53,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:53,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:40:53,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:57,445 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1147] L702-7-->L702-8: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [211#true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 33#L709-4true, 156#L702-4true, t_funThread1of3ForFork0InUse, Black: 213#(= |#race~global~0| 0), 47#L702-8true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 54#L702-10true, 217#true]) [2023-08-29 02:40:57,446 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:40:57,446 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:40:57,446 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:40:57,446 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:40:57,919 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1306] L702-5-->L702-7: Formula: (= v_~global~0_109 (+ |v_t_funThread3of3ForFork0_#t~post5_9| 1)) InVars {t_funThread3of3ForFork0_#t~post5=|v_t_funThread3of3ForFork0_#t~post5_9|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_13|, t_funThread3of3ForFork0_#t~post5=|v_t_funThread3of3ForFork0_#t~post5_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet6, ~global~0][113], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 33#L709-4true, Black: 211#true, t_funThread1of3ForFork0InUse, 3#L702-7true, 213#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, 91#L702-7true, t_funThread3of3ForFork0InUse, 54#L702-10true, 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:40:57,919 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:40:57,919 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:40:57,920 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:40:57,920 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:40:59,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][75], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, 29#L702-17true, Black: 211#true, 70#L702-4true, t_funThread1of3ForFork0InUse, 213#(= |#race~global~0| 0), 100#ULTIMATE.startEXITtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 217#true]) [2023-08-29 02:40:59,779 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,779 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,779 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,780 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,780 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][75], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, 29#L702-17true, Black: 211#true, 70#L702-4true, t_funThread1of3ForFork0InUse, 213#(= |#race~global~0| 0), 50#L711-9true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 217#true]) [2023-08-29 02:40:59,780 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,780 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,780 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:40:59,780 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:18,488 INFO L130 PetriNetUnfolder]: 278526/430424 cut-off events. [2023-08-29 02:41:18,488 INFO L131 PetriNetUnfolder]: For 194480/196373 co-relation queries the response was YES. [2023-08-29 02:41:19,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025390 conditions, 430424 events. 278526/430424 cut-off events. For 194480/196373 co-relation queries the response was YES. Maximal size of possible extension queue 8949. Compared 4079602 event pairs, 185765 based on Foata normal form. 67/381357 useless extension candidates. Maximal degree in co-relation 178319. Up to 339044 conditions per place. [2023-08-29 02:41:21,105 INFO L137 encePairwiseOnDemand]: 338/351 looper letters, 100 selfloop transitions, 22 changer transitions 0/166 dead transitions. [2023-08-29 02:41:21,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 166 transitions, 826 flow [2023-08-29 02:41:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:41:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:41:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-29 02:41:21,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2023-08-29 02:41:21,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-29 02:41:21,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-29 02:41:21,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:41:21,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-29 02:41:21,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 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:41:21,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:41:21,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:41:21,110 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 400 flow. Second operand 3 states and 624 transitions. [2023-08-29 02:41:21,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 166 transitions, 826 flow [2023-08-29 02:41:21,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:41:21,585 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 566 flow [2023-08-29 02:41:21,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2023-08-29 02:41:21,585 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2023-08-29 02:41:21,585 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 566 flow [2023-08-29 02:41:21,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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:41:21,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:41:21,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:41:21,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 02:41:21,586 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:41:21,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:41:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1648295832, now seen corresponding path program 1 times [2023-08-29 02:41:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:41:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76792827] [2023-08-29 02:41:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:41:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:41:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:41:21,601 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:41:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:41:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76792827] [2023-08-29 02:41:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76792827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:41:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:41:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:41:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151417149] [2023-08-29 02:41:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:41:21,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:41:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:41:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:41:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:41:21,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:41:21,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:41:21,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:41:21,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:41:21,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:41:28,827 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 33#L709-4true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true, 197#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:41:28,827 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:41:28,827 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:28,827 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:28,827 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:29,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 156#L702-4true, Black: 211#true, 63#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:29,864 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:41:29,864 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:29,864 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:29,864 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:30,725 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 28#L691true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:30,725 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,726 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,726 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,726 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 26#L691-2true, 74#L702-17true, 156#L702-4true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:30,754 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,754 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,754 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:30,754 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:31,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 31#L709-6true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true]) [2023-08-29 02:41:31,499 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:41:31,499 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:31,499 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:31,499 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:33,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 156#L702-4true, 44#L711-14true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true]) [2023-08-29 02:41:33,206 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event [2023-08-29 02:41:33,206 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:33,206 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:33,206 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:34,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 156#L702-4true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 100#ULTIMATE.startEXITtrue, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true]) [2023-08-29 02:41:34,813 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,813 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,813 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,813 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 156#L702-4true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 50#L711-9true, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:34,819 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,819 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,819 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:34,819 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:39,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 33#L709-4true, 74#L702-17true, Black: 211#true, 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:39,801 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:41:39,801 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:41:39,802 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:41:39,802 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:41:40,788 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 28#L691true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true, 55#L702-18true]) [2023-08-29 02:41:40,788 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 26#L691-2true, 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true, 55#L702-18true]) [2023-08-29 02:41:40,885 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,885 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,885 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:40,885 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:41:41,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 31#L709-6true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true, 55#L702-18true]) [2023-08-29 02:41:41,777 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is not cut-off event [2023-08-29 02:41:41,777 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:41:41,778 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:41:41,778 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:41:42,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, 44#L711-14true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true, 55#L702-18true]) [2023-08-29 02:41:42,787 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is not cut-off event [2023-08-29 02:41:42,787 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:41:42,787 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:41:42,787 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:41:43,045 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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-24true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 33#L709-4true, 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true]) [2023-08-29 02:41:43,045 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:41:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:41:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:41:43,045 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:41:43,757 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 100#ULTIMATE.startEXITtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true, 55#L702-18true]) [2023-08-29 02:41:43,757 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,757 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,757 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,757 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 74#L702-17true, Black: 211#true, t_funThread1of3ForFork0InUse, 50#L711-9true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 217#true, 55#L702-18true]) [2023-08-29 02:41:43,766 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,766 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,766 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:43,766 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:41:44,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1180] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 63#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 174#L702-17true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true, 10#L702-28true]) [2023-08-29 02:41:44,163 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:41:44,163 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:41:44,163 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:41:44,163 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:41:45,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 189#L702-28true, 74#L702-17true, 33#L709-4true, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true]) [2023-08-29 02:41:45,004 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is not cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:41:45,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1136] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 33#L709-4true, 74#L702-17true, 145#t_funEXITtrue, Black: 211#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 217#true]) [2023-08-29 02:41:45,004 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,004 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1180] 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], [Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 63#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, 131#t_funEXITtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 174#L702-17true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 217#true]) [2023-08-29 02:41:45,110 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,111 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,111 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:45,111 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:41:51,664 INFO L130 PetriNetUnfolder]: 316428/486058 cut-off events. [2023-08-29 02:41:51,664 INFO L131 PetriNetUnfolder]: For 338770/349765 co-relation queries the response was YES. [2023-08-29 02:41:52,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233433 conditions, 486058 events. 316428/486058 cut-off events. For 338770/349765 co-relation queries the response was YES. Maximal size of possible extension queue 10209. Compared 4629209 event pairs, 194215 based on Foata normal form. 209/423326 useless extension candidates. Maximal degree in co-relation 359301. Up to 385766 conditions per place. [2023-08-29 02:41:54,608 INFO L137 encePairwiseOnDemand]: 338/351 looper letters, 118 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2023-08-29 02:41:54,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 196 transitions, 1147 flow [2023-08-29 02:41:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:41:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:41:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2023-08-29 02:41:54,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5916429249762583 [2023-08-29 02:41:54,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 623 transitions. [2023-08-29 02:41:54,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 623 transitions. [2023-08-29 02:41:54,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:41:54,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 623 transitions. [2023-08-29 02:41:54,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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:41:54,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:41:54,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:41:54,612 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 566 flow. Second operand 3 states and 623 transitions. [2023-08-29 02:41:54,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 196 transitions, 1147 flow [2023-08-29 02:42:03,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 196 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:03,387 INFO L231 Difference]: Finished difference. Result has 107 places, 164 transitions, 880 flow [2023-08-29 02:42:03,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=107, PETRI_TRANSITIONS=164} [2023-08-29 02:42:03,388 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2023-08-29 02:42:03,388 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 164 transitions, 880 flow [2023-08-29 02:42:03,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:42:03,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:03,388 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:42:03,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 02:42:03,389 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:42:03,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2044996132, now seen corresponding path program 1 times [2023-08-29 02:42:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203913320] [2023-08-29 02:42:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:03,413 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:42:03,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203913320] [2023-08-29 02:42:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203913320] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:42:03,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605099341] [2023-08-29 02:42:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:03,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:42:03,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:42:03,418 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:42:03,419 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:42:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:03,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:42:03,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:42:03,491 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:42:03,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:42:03,506 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:42:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605099341] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:42:03,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:42:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:42:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915102784] [2023-08-29 02:42:03,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:42:03,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:42:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:42:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:42:03,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 351 [2023-08-29 02:42:03,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 164 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 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:42:03,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:03,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 351 [2023-08-29 02:42:03,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:04,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true]) [2023-08-29 02:42:04,337 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,337 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,337 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,337 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,394 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 70#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:04,394 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,394 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,394 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,394 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:04,512 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, 93#L702-8true, 223#true, Black: 217#true]) [2023-08-29 02:42:04,512 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 02:42:04,512 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:04,512 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:04,512 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:04,526 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true]) [2023-08-29 02:42:04,526 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 02:42:04,526 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:04,526 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:04,526 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:04,526 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:04,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:04,689 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:42:04,689 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:04,689 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:04,689 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:04,878 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L702-4true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:04,878 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:42:04,878 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:04,878 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:04,878 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:05,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 161#L702-3true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:05,151 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:42:05,152 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:05,152 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:05,152 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:05,292 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 197#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:05,292 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,292 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,292 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,292 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,307 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:05,307 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,307 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,307 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,307 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,331 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:05,331 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,331 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,331 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,332 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 161#L702-3true, 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,574 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,574 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,574 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,575 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 161#L702-3true, 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,577 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,577 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,577 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,577 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,578 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 161#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:05,578 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,578 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,578 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,578 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 174#L702-17true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true]) [2023-08-29 02:42:05,595 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,595 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,595 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,595 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:05,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 174#L702-17true, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true]) [2023-08-29 02:42:05,595 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,596 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,596 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,596 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:05,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 160#L702-16true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:05,685 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,685 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,685 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,685 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 197#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:05,709 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,709 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,709 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,709 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, 70#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,715 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,716 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 70#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,716 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,716 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,728 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,728 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,728 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,728 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,728 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:05,731 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:05,731 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,731 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, 156#L702-4true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:42:05,748 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,748 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,748 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,748 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, 156#L702-4true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:42:05,748 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,748 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,748 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,749 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:05,753 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:05,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:05,753 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,753 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,774 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:05,774 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,774 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,774 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,774 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 213#(= |#race~global~0| 0), 7#L702-27true, 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:05,779 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,779 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,779 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,779 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:05,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, 91#L702-7true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:05,807 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,807 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,807 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,807 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 160#L702-16true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:05,825 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,825 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,825 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,825 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,872 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 197#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:05,872 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:05,872 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 197#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:05,872 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,872 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,944 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 160#L702-16true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:05,944 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,944 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,944 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,944 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:05,949 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,949 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,949 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:05,949 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:06,026 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 91#L702-7true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,026 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,027 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,027 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,027 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,042 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, 91#L702-7true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,042 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:42:06,042 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:06,042 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:06,042 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:06,048 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 91#L702-7true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 121#L702-27true]) [2023-08-29 02:42:06,048 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,048 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,048 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,048 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1266] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |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_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 160#L702-16true, 93#L702-8true, 223#true, Black: 217#true, 55#L702-18true]) [2023-08-29 02:42:06,077 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,077 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,077 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,077 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:06,098 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,098 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,098 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,098 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,098 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,137 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,137 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,137 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,137 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,137 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,137 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][135], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 40#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 115#L702-8true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:06,259 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,259 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,259 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,259 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:06,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,267 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,267 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,267 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,267 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,351 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [113#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,351 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,351 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,351 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,351 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,351 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 161#L702-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 112#L702-21true, 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:06,404 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,404 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:06,553 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 70#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, 112#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:06,553 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 02:42:06,553 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:42:06,553 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:42:06,553 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:42:06,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L702-8-->L702-10: Formula: (= |v_#race~global~0_82| |v_t_funThread2of3ForFork0_#t~nondet6_13|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_82|} 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_82|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~post5][99], [Black: 223#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, 112#L702-21true, 140#L702-10true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 213#(= |#race~global~0| 0), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:06,869 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,869 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,869 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,869 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,972 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 40#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:06,973 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,973 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,973 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:06,973 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 91#L702-7true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, 25#L707-7true, 112#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,031 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,031 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,031 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,031 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 174#L702-17true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:07,049 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is not cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:07,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 174#L702-17true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 02:42:07,049 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:07,134 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,134 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,134 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,134 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,134 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,135 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 40#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 55#L702-18true]) [2023-08-29 02:42:07,135 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,135 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,135 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,135 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,159 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,159 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,159 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,159 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,159 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1312] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 40#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 55#L702-18true]) [2023-08-29 02:42:07,161 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 40#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:07,168 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,168 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,168 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,168 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,181 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 55#L702-18true]) [2023-08-29 02:42:07,182 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:07,182 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 144#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 55#L702-18true]) [2023-08-29 02:42:07,182 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,182 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:07,219 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 112#L702-21true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,219 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,219 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,219 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,219 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,289 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 213#(= |#race~global~0| 0), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:07,289 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:42:07,289 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:07,289 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:07,289 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:07,289 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true, 121#L702-27true]) [2023-08-29 02:42:07,289 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,290 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,290 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,290 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:07,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 164#L707-13true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 112#L702-21true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 160#L702-16true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,336 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,336 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,336 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,336 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, 112#L702-21true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 7#L702-27true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,391 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,391 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,391 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,391 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:07,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] L702-19-->L702-21: Formula: (= (+ v_~global~0_105 1) |v_t_funThread3of3ForFork0_#t~post8_9|) 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_105} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][165], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 34#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 25#L707-7true, 112#L702-21true, Black: 211#true, 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 160#L702-16true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 223#true]) [2023-08-29 02:42:07,493 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:42:07,493 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:07,493 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:07,493 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:07,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |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_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][177], [Black: 225#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 137#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 25#L707-7true, 112#L702-21true, Black: 208#(= |ULTIMATE.start_main_~i~0#1| 0), 194#L702-22true, Black: 213#(= |#race~global~0| 0), 309#(< |ULTIMATE.start_main_~i~0#1| 10000), 223#true, Black: 219#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:07,913 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:42:07,913 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:42:07,913 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:42:07,913 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:42:08,159 INFO L130 PetriNetUnfolder]: 43084/74590 cut-off events. [2023-08-29 02:42:08,159 INFO L131 PetriNetUnfolder]: For 91413/99852 co-relation queries the response was YES. [2023-08-29 02:42:08,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205828 conditions, 74590 events. 43084/74590 cut-off events. For 91413/99852 co-relation queries the response was YES. Maximal size of possible extension queue 2372. Compared 716128 event pairs, 6250 based on Foata normal form. 7756/76471 useless extension candidates. Maximal degree in co-relation 55242. Up to 43126 conditions per place. [2023-08-29 02:42:08,559 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 155 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2023-08-29 02:42:08,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 238 transitions, 1511 flow [2023-08-29 02:42:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:42:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:42:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1226 transitions. [2023-08-29 02:42:08,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821462488129154 [2023-08-29 02:42:08,562 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1226 transitions. [2023-08-29 02:42:08,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1226 transitions. [2023-08-29 02:42:08,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:08,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1226 transitions. [2023-08-29 02:42:08,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 204.33333333333334) internal successors, (1226), 6 states have internal predecessors, (1226), 0 states have call successors, (0), 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:42:08,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:42:08,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:42:08,566 INFO L175 Difference]: Start difference. First operand has 107 places, 164 transitions, 880 flow. Second operand 6 states and 1226 transitions. [2023-08-29 02:42:08,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 238 transitions, 1511 flow [2023-08-29 02:42:08,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 238 transitions, 1421 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:08,628 INFO L231 Difference]: Finished difference. Result has 97 places, 139 transitions, 689 flow [2023-08-29 02:42:08,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=689, PETRI_PLACES=97, PETRI_TRANSITIONS=139} [2023-08-29 02:42:08,629 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2023-08-29 02:42:08,629 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 139 transitions, 689 flow [2023-08-29 02:42:08,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 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:42:08,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:08,630 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:42:08,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 02:42:08,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:42:08,834 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:42:08,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1858634724, now seen corresponding path program 1 times [2023-08-29 02:42:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895807459] [2023-08-29 02:42:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:08,856 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:42:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895807459] [2023-08-29 02:42:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895807459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221338540] [2023-08-29 02:42:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:08,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:42:08,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 139 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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:42:08,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:08,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:42:08,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:14,531 INFO L130 PetriNetUnfolder]: 59330/94424 cut-off events. [2023-08-29 02:42:14,531 INFO L131 PetriNetUnfolder]: For 108799/112556 co-relation queries the response was YES. [2023-08-29 02:42:14,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267449 conditions, 94424 events. 59330/94424 cut-off events. For 108799/112556 co-relation queries the response was YES. Maximal size of possible extension queue 2462. Compared 808388 event pairs, 35299 based on Foata normal form. 207/86834 useless extension candidates. Maximal degree in co-relation 246150. Up to 73848 conditions per place. [2023-08-29 02:42:15,219 INFO L137 encePairwiseOnDemand]: 339/351 looper letters, 114 selfloop transitions, 38 changer transitions 0/191 dead transitions. [2023-08-29 02:42:15,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 191 transitions, 1245 flow [2023-08-29 02:42:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2023-08-29 02:42:15,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2023-08-29 02:42:15,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 598 transitions. [2023-08-29 02:42:15,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 598 transitions. [2023-08-29 02:42:15,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:15,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 598 transitions. [2023-08-29 02:42:15,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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:42:15,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,224 INFO L175 Difference]: Start difference. First operand has 97 places, 139 transitions, 689 flow. Second operand 3 states and 598 transitions. [2023-08-29 02:42:15,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 191 transitions, 1245 flow [2023-08-29 02:42:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 191 transitions, 1234 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 02:42:15,243 INFO L231 Difference]: Finished difference. Result has 98 places, 169 transitions, 1082 flow [2023-08-29 02:42:15,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=94, 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=98, PETRI_TRANSITIONS=169} [2023-08-29 02:42:15,243 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-29 02:42:15,243 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 169 transitions, 1082 flow [2023-08-29 02:42:15,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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:42:15,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:15,244 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:42:15,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 02:42:15,244 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:42:15,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1336675664, now seen corresponding path program 1 times [2023-08-29 02:42:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919950561] [2023-08-29 02:42:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:15,301 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:42:15,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919950561] [2023-08-29 02:42:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919950561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:15,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 02:42:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083138187] [2023-08-29 02:42:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:15,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 02:42:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 02:42:15,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 02:42:15,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 351 [2023-08-29 02:42:15,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 169 transitions, 1082 flow. Second operand has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:15,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:15,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 351 [2023-08-29 02:42:15,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:15,482 INFO L130 PetriNetUnfolder]: 395/1419 cut-off events. [2023-08-29 02:42:15,482 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2023-08-29 02:42:15,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 1419 events. 395/1419 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8512 event pairs, 44 based on Foata normal form. 378/1797 useless extension candidates. Maximal degree in co-relation 2240. Up to 810 conditions per place. [2023-08-29 02:42:15,487 INFO L137 encePairwiseOnDemand]: 344/351 looper letters, 37 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-08-29 02:42:15,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 76 transitions, 384 flow [2023-08-29 02:42:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:42:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:42:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 775 transitions. [2023-08-29 02:42:15,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.551994301994302 [2023-08-29 02:42:15,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 775 transitions. [2023-08-29 02:42:15,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 775 transitions. [2023-08-29 02:42:15,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:15,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 775 transitions. [2023-08-29 02:42:15,490 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:42:15,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 351.0) internal successors, (1755), 5 states have internal predecessors, (1755), 0 states have call successors, (0), 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:42:15,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 351.0) internal successors, (1755), 5 states have internal predecessors, (1755), 0 states have call successors, (0), 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:42:15,492 INFO L175 Difference]: Start difference. First operand has 98 places, 169 transitions, 1082 flow. Second operand 4 states and 775 transitions. [2023-08-29 02:42:15,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 76 transitions, 384 flow [2023-08-29 02:42:15,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 278 flow, removed 33 selfloop flow, removed 10 redundant places. [2023-08-29 02:42:15,495 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 176 flow [2023-08-29 02:42:15,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-08-29 02:42:15,496 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -16 predicate places. [2023-08-29 02:42:15,496 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 176 flow [2023-08-29 02:42:15,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:15,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:15,497 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:42:15,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 02:42:15,497 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:42:15,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash -760000911, now seen corresponding path program 1 times [2023-08-29 02:42:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516575379] [2023-08-29 02:42:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:15,528 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:42:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516575379] [2023-08-29 02:42:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516575379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473208159] [2023-08-29 02:42:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:15,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:15,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:42:15,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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:42:15,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:15,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:42:15,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:15,644 INFO L130 PetriNetUnfolder]: 481/1466 cut-off events. [2023-08-29 02:42:15,645 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2023-08-29 02:42:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 1466 events. 481/1466 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8404 event pairs, 447 based on Foata normal form. 0/1462 useless extension candidates. Maximal degree in co-relation 1586. Up to 1023 conditions per place. [2023-08-29 02:42:15,647 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 49 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-29 02:42:15,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 304 flow [2023-08-29 02:42:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-08-29 02:42:15,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441595441595442 [2023-08-29 02:42:15,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-08-29 02:42:15,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-08-29 02:42:15,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:15,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-08-29 02:42:15,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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:42:15,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,652 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 176 flow. Second operand 3 states and 573 transitions. [2023-08-29 02:42:15,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 304 flow [2023-08-29 02:42:15,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:15,653 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 171 flow [2023-08-29 02:42:15,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=79, 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=171, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-08-29 02:42:15,653 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -17 predicate places. [2023-08-29 02:42:15,654 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 171 flow [2023-08-29 02:42:15,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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:42:15,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:15,654 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:42:15,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 02:42:15,654 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:42:15,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1533571380, now seen corresponding path program 1 times [2023-08-29 02:42:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993332310] [2023-08-29 02:42:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:15,672 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:42:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993332310] [2023-08-29 02:42:15,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993332310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:15,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:15,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:15,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402552585] [2023-08-29 02:42:15,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:15,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:15,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:42:15,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 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:42:15,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:15,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:42:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:15,784 INFO L130 PetriNetUnfolder]: 481/1448 cut-off events. [2023-08-29 02:42:15,785 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2023-08-29 02:42:15,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1448 events. 481/1448 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8203 event pairs, 467 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1776. Up to 1067 conditions per place. [2023-08-29 02:42:15,788 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 44 selfloop transitions, 2 changer transitions 3/72 dead transitions. [2023-08-29 02:42:15,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 72 transitions, 284 flow [2023-08-29 02:42:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-08-29 02:42:15,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2023-08-29 02:42:15,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-08-29 02:42:15,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-08-29 02:42:15,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:15,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-08-29 02:42:15,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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:42:15,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,792 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 171 flow. Second operand 3 states and 572 transitions. [2023-08-29 02:42:15,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 72 transitions, 284 flow [2023-08-29 02:42:15,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:15,793 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 162 flow [2023-08-29 02:42:15,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=78, 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=162, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2023-08-29 02:42:15,794 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -18 predicate places. [2023-08-29 02:42:15,794 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 162 flow [2023-08-29 02:42:15,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 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:42:15,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:15,795 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:42:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 02:42:15,795 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:42:15,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 190472837, now seen corresponding path program 1 times [2023-08-29 02:42:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:15,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040982844] [2023-08-29 02:42:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:15,813 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:42:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040982844] [2023-08-29 02:42:15,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040982844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:15,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125747952] [2023-08-29 02:42:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:15,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:15,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:15,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:15,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 351 [2023-08-29 02:42:15,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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:42:15,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:15,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 351 [2023-08-29 02:42:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:15,906 INFO L130 PetriNetUnfolder]: 357/1060 cut-off events. [2023-08-29 02:42:15,906 INFO L131 PetriNetUnfolder]: For 351/351 co-relation queries the response was YES. [2023-08-29 02:42:15,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 1060 events. 357/1060 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5632 event pairs, 349 based on Foata normal form. 12/1068 useless extension candidates. Maximal degree in co-relation 1396. Up to 787 conditions per place. [2023-08-29 02:42:15,908 INFO L137 encePairwiseOnDemand]: 349/351 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2023-08-29 02:42:15,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 254 flow [2023-08-29 02:42:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-08-29 02:42:15,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394112060778727 [2023-08-29 02:42:15,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-08-29 02:42:15,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-08-29 02:42:15,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:15,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-08-29 02:42:15,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 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:42:15,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:42:15,912 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 162 flow. Second operand 3 states and 568 transitions. [2023-08-29 02:42:15,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 254 flow [2023-08-29 02:42:15,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:15,913 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2023-08-29 02:42:15,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, 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=76, PETRI_TRANSITIONS=0} [2023-08-29 02:42:15,914 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -22 predicate places. [2023-08-29 02:42:15,914 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2023-08-29 02:42:15,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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:42:15,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2023-08-29 02:42:15,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-08-29 02:42:15,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-08-29 02:42:15,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-08-29 02:42:15,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-08-29 02:42:15,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 02:42:15,917 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:42:15,917 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:42:15,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,944 INFO L130 PetriNetUnfolder]: 50/448 cut-off events. [2023-08-29 02:42:15,945 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:42:15,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 448 events. 50/448 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2023-08-29 02:42:15,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,948 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:42:15,948 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,948 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 222 transitions, 474 flow [2023-08-29 02:42:15,974 INFO L130 PetriNetUnfolder]: 50/448 cut-off events. [2023-08-29 02:42:15,975 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:42:15,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 448 events. 50/448 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2023-08-29 02:42:15,983 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:42:18,360 INFO L134 LiptonReduction]: Checked pairs total: 110041 [2023-08-29 02:42:18,360 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-29 02:42:18,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:42:18,362 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:42:18,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:42:18,367 INFO L130 PetriNetUnfolder]: 18/119 cut-off events. [2023-08-29 02:42:18,368 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 02:42:18,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:18,368 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 02:42:18,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:42:18,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2072154179, now seen corresponding path program 1 times [2023-08-29 02:42:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513255548] [2023-08-29 02:42:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:42:18,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:42:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:42:18,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:42:18,385 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:42:18,385 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:42:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 02:42:18,385 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:42:18,385 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:42:18,386 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:42:18,386 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 02:42:18,407 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 02:42:18,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,466 INFO L130 PetriNetUnfolder]: 81/696 cut-off events. [2023-08-29 02:42:18,467 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:42:18,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 696 events. 81/696 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2936 event pairs, 6 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 468. Up to 32 conditions per place. [2023-08-29 02:42:18,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,479 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:42:18,479 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,479 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 268 transitions, 580 flow [2023-08-29 02:42:18,546 INFO L130 PetriNetUnfolder]: 81/696 cut-off events. [2023-08-29 02:42:18,546 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:42:18,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 696 events. 81/696 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2936 event pairs, 6 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 468. Up to 32 conditions per place. [2023-08-29 02:42:18,569 INFO L119 LiptonReduction]: Number of co-enabled transitions 42768 [2023-08-29 02:42:20,974 INFO L134 LiptonReduction]: Checked pairs total: 165696 [2023-08-29 02:42:20,975 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-29 02:42:20,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:42:20,976 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;@48a75114, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:42:20,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-29 02:42:20,977 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:42:20,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:42:20,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:20,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:42:20,977 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:42:20,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 61735711, now seen corresponding path program 1 times [2023-08-29 02:42:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479564698] [2023-08-29 02:42:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:20,994 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:42:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479564698] [2023-08-29 02:42:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479564698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480172750] [2023-08-29 02:42:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:20,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:21,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 415 [2023-08-29 02:42:21,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:42:21,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:21,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 415 [2023-08-29 02:42:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:43:30,558 INFO L130 PetriNetUnfolder]: 667680/988127 cut-off events. [2023-08-29 02:43:30,558 INFO L131 PetriNetUnfolder]: For 25076/25076 co-relation queries the response was YES. [2023-08-29 02:43:32,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867548 conditions, 988127 events. 667680/988127 cut-off events. For 25076/25076 co-relation queries the response was YES. Maximal size of possible extension queue 18809. Compared 9725841 event pairs, 648495 based on Foata normal form. 218651/1114619 useless extension candidates. Maximal degree in co-relation 330810. Up to 864805 conditions per place. [2023-08-29 02:43:37,907 INFO L137 encePairwiseOnDemand]: 384/415 looper letters, 70 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2023-08-29 02:43:37,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 130 transitions, 448 flow [2023-08-29 02:43:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:43:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:43:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 785 transitions. [2023-08-29 02:43:37,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305220883534136 [2023-08-29 02:43:37,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 785 transitions. [2023-08-29 02:43:37,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 785 transitions. [2023-08-29 02:43:37,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:43:37,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 785 transitions. [2023-08-29 02:43:37,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 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:43:37,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 415.0) internal successors, (1660), 4 states have internal predecessors, (1660), 0 states have call successors, (0), 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:43:37,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 415.0) internal successors, (1660), 4 states have internal predecessors, (1660), 0 states have call successors, (0), 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:43:37,916 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 336 flow. Second operand 3 states and 785 transitions. [2023-08-29 02:43:37,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 130 transitions, 448 flow [2023-08-29 02:43:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:43:37,927 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 292 flow [2023-08-29 02:43:37,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2023-08-29 02:43:37,928 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 2 predicate places. [2023-08-29 02:43:37,928 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 292 flow [2023-08-29 02:43:37,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:43:37,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:43:37,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:43:37,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 02:43:37,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_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:43:37,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:43:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 699123354, now seen corresponding path program 1 times [2023-08-29 02:43:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:43:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233604753] [2023-08-29 02:43:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:43:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:43:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:43:37,971 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:43:37,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:43:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233604753] [2023-08-29 02:43:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233604753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:43:37,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:43:37,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:43:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142272889] [2023-08-29 02:43:37,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:43:37,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:43:37,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:43:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:43:37,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:43:38,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 415 [2023-08-29 02:43:38,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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:43:38,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:43:38,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 415 [2023-08-29 02:43:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand