./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread/stack-2.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/pthread/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 11:20:56,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 11:20:56,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 11:20:57,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 11:20:57,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 11:20:57,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 11:20:57,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 11:20:57,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 11:20:57,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 11:20:57,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 11:20:57,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 11:20:57,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 11:20:57,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 11:20:57,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 11:20:57,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 11:20:57,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 11:20:57,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 11:20:57,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 11:20:57,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 11:20:57,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 11:20:57,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 11:20:57,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 11:20:57,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 11:20:57,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 11:20:57,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 11:20:57,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 11:20:57,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 11:20:57,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 11:20:57,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 11:20:57,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 11:20:57,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 11:20:57,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 11:20:57,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 11:20:57,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 11:20:57,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 11:20:57,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 11:20:57,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 11:20:57,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 11:20:57,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 11:20:57,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 11:20:57,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 11:20:57,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-31 11:20:57,116 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 11:20:57,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 11:20:57,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 11:20:57,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 11:20:57,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 11:20:57,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 11:20:57,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 11:20:57,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 11:20:57,120 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 11:20:57,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 11:20:57,121 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 11:20:57,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 11:20:57,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 11:20:57,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 11:20:57,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 11:20:57,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 11:20:57,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 11:20:57,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 11:20:57,122 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-31 11:20:57,123 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 11:20:57,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 11:20:57,124 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 11:20:57,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 11:20:57,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 11:20:57,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 11:20:57,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 11:20:57,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 11:20:57,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 11:20:57,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 11:20:57,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 11:20:57,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 11:20:57,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 11:20:57,127 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 11:20:57,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 11:20:57,127 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 11:20:57,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 11:20:57,127 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 11:20:57,128 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 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 -> BEFORE [2023-08-31 11:20:57,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 11:20:57,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 11:20:57,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 11:20:57,448 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 11:20:57,448 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 11:20:57,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2023-08-31 11:20:58,498 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 11:20:58,764 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 11:20:58,779 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2023-08-31 11:20:58,799 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd80ac29e/80619acb1b4349879ae23d97da31b17d/FLAG4065a284c [2023-08-31 11:20:58,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd80ac29e/80619acb1b4349879ae23d97da31b17d [2023-08-31 11:20:58,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 11:20:58,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 11:20:58,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 11:20:58,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 11:20:58,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 11:20:58,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:58" (1/1) ... [2023-08-31 11:20:58,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a45ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:58, skipping insertion in model container [2023-08-31 11:20:58,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:58" (1/1) ... [2023-08-31 11:20:58,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 11:20:58,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 11:20:59,285 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2023-08-31 11:20:59,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 11:20:59,326 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 11:20:59,380 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2023-08-31 11:20:59,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 11:20:59,497 INFO L208 MainTranslator]: Completed translation [2023-08-31 11:20:59,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59 WrapperNode [2023-08-31 11:20:59,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 11:20:59,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 11:20:59,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 11:20:59,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 11:20:59,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,573 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 208 [2023-08-31 11:20:59,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 11:20:59,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 11:20:59,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 11:20:59,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 11:20:59,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 11:20:59,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 11:20:59,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 11:20:59,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 11:20:59,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (1/1) ... [2023-08-31 11:20:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 11:20:59,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 11:20:59,645 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-31 11:20:59,647 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-31 11:20:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-31 11:20:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-31 11:20:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-31 11:20:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-31 11:20:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 11:20:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 11:20:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 11:20:59,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 11:20:59,677 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 11:20:59,873 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 11:20:59,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 11:21:00,243 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 11:21:00,251 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 11:21:00,251 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-31 11:21:00,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:00 BoogieIcfgContainer [2023-08-31 11:21:00,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 11:21:00,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 11:21:00,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 11:21:00,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 11:21:00,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:20:58" (1/3) ... [2023-08-31 11:21:00,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfa6871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:00, skipping insertion in model container [2023-08-31 11:21:00,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:59" (2/3) ... [2023-08-31 11:21:00,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfa6871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:00, skipping insertion in model container [2023-08-31 11:21:00,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:00" (3/3) ... [2023-08-31 11:21:00,260 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2023-08-31 11:21:00,266 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 11:21:00,273 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 11:21:00,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-31 11:21:00,274 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 11:21:00,373 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 11:21:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 222 transitions, 460 flow [2023-08-31 11:21:00,522 INFO L130 PetriNetUnfolder]: 10/220 cut-off events. [2023-08-31 11:21:00,523 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 11:21:00,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 220 events. 10/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 548 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 174. Up to 3 conditions per place. [2023-08-31 11:21:00,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 222 transitions, 460 flow [2023-08-31 11:21:00,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 211 transitions, 431 flow [2023-08-31 11:21:00,545 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 11:21:00,561 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 211 transitions, 431 flow [2023-08-31 11:21:00,564 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 211 transitions, 431 flow [2023-08-31 11:21:00,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 211 transitions, 431 flow [2023-08-31 11:21:00,623 INFO L130 PetriNetUnfolder]: 10/211 cut-off events. [2023-08-31 11:21:00,624 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 11:21:00,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 211 events. 10/211 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 493 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 174. Up to 3 conditions per place. [2023-08-31 11:21:00,637 INFO L119 LiptonReduction]: Number of co-enabled transitions 17082 [2023-08-31 11:21:04,234 INFO L134 LiptonReduction]: Checked pairs total: 62246 [2023-08-31 11:21:04,234 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-31 11:21:04,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 11:21:04,250 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;@146c859a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 11:21:04,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-08-31 11:21:04,254 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2023-08-31 11:21:04,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 11:21:04,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:04,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 11:21:04,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:04,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1384946515, now seen corresponding path program 1 times [2023-08-31 11:21:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037375245] [2023-08-31 11:21:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:04,452 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-31 11:21:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:04,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037375245] [2023-08-31 11:21:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037375245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:21:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936938353] [2023-08-31 11:21:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:21:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:21:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:21:04,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 368 [2023-08-31 11:21:04,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:04,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:04,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 368 [2023-08-31 11:21:04,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:04,997 INFO L130 PetriNetUnfolder]: 1926/4094 cut-off events. [2023-08-31 11:21:04,997 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-31 11:21:05,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 4094 events. 1926/4094 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 25274 event pairs, 614 based on Foata normal form. 0/3725 useless extension candidates. Maximal degree in co-relation 6946. Up to 2252 conditions per place. [2023-08-31 11:21:05,021 INFO L137 encePairwiseOnDemand]: 348/368 looper letters, 82 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2023-08-31 11:21:05,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 463 flow [2023-08-31 11:21:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:21:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:21:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2023-08-31 11:21:05,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114130434782609 [2023-08-31 11:21:05,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 675 transitions. [2023-08-31 11:21:05,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 675 transitions. [2023-08-31 11:21:05,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:05,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 675 transitions. [2023-08-31 11:21:05,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,065 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 177 flow. Second operand 3 states and 675 transitions. [2023-08-31 11:21:05,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 463 flow [2023-08-31 11:21:05,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 455 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 11:21:05,071 INFO L231 Difference]: Finished difference. Result has 87 places, 98 transitions, 296 flow [2023-08-31 11:21:05,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=87, PETRI_TRANSITIONS=98} [2023-08-31 11:21:05,075 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2023-08-31 11:21:05,076 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 98 transitions, 296 flow [2023-08-31 11:21:05,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:05,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:21:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 11:21:05,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:05,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 814886425, now seen corresponding path program 1 times [2023-08-31 11:21:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478986568] [2023-08-31 11:21:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:05,130 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-31 11:21:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478986568] [2023-08-31 11:21:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478986568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:21:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784168047] [2023-08-31 11:21:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:05,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:21:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:21:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:21:05,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 368 [2023-08-31 11:21:05,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:05,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 368 [2023-08-31 11:21:05,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:05,793 INFO L130 PetriNetUnfolder]: 2930/6562 cut-off events. [2023-08-31 11:21:05,793 INFO L131 PetriNetUnfolder]: For 984/1034 co-relation queries the response was YES. [2023-08-31 11:21:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12988 conditions, 6562 events. 2930/6562 cut-off events. For 984/1034 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 49018 event pairs, 914 based on Foata normal form. 0/5979 useless extension candidates. Maximal degree in co-relation 12399. Up to 2554 conditions per place. [2023-08-31 11:21:05,833 INFO L137 encePairwiseOnDemand]: 364/368 looper letters, 85 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2023-08-31 11:21:05,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 139 transitions, 591 flow [2023-08-31 11:21:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:21:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:21:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2023-08-31 11:21:05,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6322463768115942 [2023-08-31 11:21:05,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2023-08-31 11:21:05,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2023-08-31 11:21:05,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:05,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2023-08-31 11:21:05,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,854 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 296 flow. Second operand 3 states and 698 transitions. [2023-08-31 11:21:05,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 139 transitions, 591 flow [2023-08-31 11:21:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 11:21:05,868 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 294 flow [2023-08-31 11:21:05,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2023-08-31 11:21:05,869 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 3 predicate places. [2023-08-31 11:21:05,869 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 294 flow [2023-08-31 11:21:05,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:05,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:05,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:21:05,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 11:21:05,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:05,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1235453056, now seen corresponding path program 1 times [2023-08-31 11:21:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285015299] [2023-08-31 11:21:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:06,270 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-31 11:21:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285015299] [2023-08-31 11:21:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285015299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:06,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 11:21:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857890940] [2023-08-31 11:21:06,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:06,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 11:21:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 11:21:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 11:21:06,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 368 [2023-08-31 11:21:06,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 199.66666666666666) internal successors, (1198), 6 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:06,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:06,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 368 [2023-08-31 11:21:06,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:09,778 INFO L130 PetriNetUnfolder]: 23094/41935 cut-off events. [2023-08-31 11:21:09,779 INFO L131 PetriNetUnfolder]: For 5364/5824 co-relation queries the response was YES. [2023-08-31 11:21:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86135 conditions, 41935 events. 23094/41935 cut-off events. For 5364/5824 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 363583 event pairs, 6363 based on Foata normal form. 18/37511 useless extension candidates. Maximal degree in co-relation 84880. Up to 19919 conditions per place. [2023-08-31 11:21:10,037 INFO L137 encePairwiseOnDemand]: 358/368 looper letters, 203 selfloop transitions, 21 changer transitions 0/271 dead transitions. [2023-08-31 11:21:10,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 271 transitions, 1203 flow [2023-08-31 11:21:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 11:21:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 11:21:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2023-08-31 11:21:10,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6240942028985508 [2023-08-31 11:21:10,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1378 transitions. [2023-08-31 11:21:10,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1378 transitions. [2023-08-31 11:21:10,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:10,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1378 transitions. [2023-08-31 11:21:10,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:10,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:10,051 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:10,051 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 294 flow. Second operand 6 states and 1378 transitions. [2023-08-31 11:21:10,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 271 transitions, 1203 flow [2023-08-31 11:21:10,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 271 transitions, 1189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 11:21:10,062 INFO L231 Difference]: Finished difference. Result has 97 places, 121 transitions, 430 flow [2023-08-31 11:21:10,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=97, PETRI_TRANSITIONS=121} [2023-08-31 11:21:10,063 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2023-08-31 11:21:10,064 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 121 transitions, 430 flow [2023-08-31 11:21:10,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.66666666666666) internal successors, (1198), 6 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:10,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:10,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:21:10,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 11:21:10,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:10,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1210008494, now seen corresponding path program 1 times [2023-08-31 11:21:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:10,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140847799] [2023-08-31 11:21:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:10,102 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-31 11:21:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140847799] [2023-08-31 11:21:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140847799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:10,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:21:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635795897] [2023-08-31 11:21:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:10,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:21:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:21:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:21:10,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 368 [2023-08-31 11:21:10,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 121 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:10,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:10,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 368 [2023-08-31 11:21:10,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:12,329 INFO L130 PetriNetUnfolder]: 10717/27643 cut-off events. [2023-08-31 11:21:12,330 INFO L131 PetriNetUnfolder]: For 3655/3957 co-relation queries the response was YES. [2023-08-31 11:21:12,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56595 conditions, 27643 events. 10717/27643 cut-off events. For 3655/3957 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 298003 event pairs, 4049 based on Foata normal form. 113/25382 useless extension candidates. Maximal degree in co-relation 55997. Up to 12361 conditions per place. [2023-08-31 11:21:12,484 INFO L137 encePairwiseOnDemand]: 363/368 looper letters, 80 selfloop transitions, 3 changer transitions 0/154 dead transitions. [2023-08-31 11:21:12,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 154 transitions, 697 flow [2023-08-31 11:21:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:21:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:21:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2023-08-31 11:21:12,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2023-08-31 11:21:12,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2023-08-31 11:21:12,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2023-08-31 11:21:12,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:12,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2023-08-31 11:21:12,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:12,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:12,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:12,498 INFO L175 Difference]: Start difference. First operand has 97 places, 121 transitions, 430 flow. Second operand 3 states and 688 transitions. [2023-08-31 11:21:12,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 154 transitions, 697 flow [2023-08-31 11:21:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 154 transitions, 697 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 11:21:12,527 INFO L231 Difference]: Finished difference. Result has 101 places, 123 transitions, 454 flow [2023-08-31 11:21:12,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=101, PETRI_TRANSITIONS=123} [2023-08-31 11:21:12,529 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2023-08-31 11:21:12,529 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 123 transitions, 454 flow [2023-08-31 11:21:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:12,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:12,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:21:12,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 11:21:12,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:12,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1235946553, now seen corresponding path program 1 times [2023-08-31 11:21:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445380574] [2023-08-31 11:21:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:12,900 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-31 11:21:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445380574] [2023-08-31 11:21:12,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445380574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:12,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:12,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 11:21:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685232717] [2023-08-31 11:21:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:12,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 11:21:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 11:21:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 11:21:12,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 368 [2023-08-31 11:21:12,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 123 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:12,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:12,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 368 [2023-08-31 11:21:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:17,511 INFO L130 PetriNetUnfolder]: 33276/61656 cut-off events. [2023-08-31 11:21:17,512 INFO L131 PetriNetUnfolder]: For 34209/34814 co-relation queries the response was YES. [2023-08-31 11:21:17,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154666 conditions, 61656 events. 33276/61656 cut-off events. For 34209/34814 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 554187 event pairs, 17213 based on Foata normal form. 0/57245 useless extension candidates. Maximal degree in co-relation 153505. Up to 47454 conditions per place. [2023-08-31 11:21:17,905 INFO L137 encePairwiseOnDemand]: 354/368 looper letters, 160 selfloop transitions, 44 changer transitions 0/246 dead transitions. [2023-08-31 11:21:17,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 246 transitions, 1246 flow [2023-08-31 11:21:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 11:21:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 11:21:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1288 transitions. [2023-08-31 11:21:17,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-31 11:21:17,915 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1288 transitions. [2023-08-31 11:21:17,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1288 transitions. [2023-08-31 11:21:17,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:17,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1288 transitions. [2023-08-31 11:21:17,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:17,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:17,923 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:17,923 INFO L175 Difference]: Start difference. First operand has 101 places, 123 transitions, 454 flow. Second operand 6 states and 1288 transitions. [2023-08-31 11:21:17,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 246 transitions, 1246 flow [2023-08-31 11:21:18,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 246 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 11:21:18,241 INFO L231 Difference]: Finished difference. Result has 108 places, 162 transitions, 754 flow [2023-08-31 11:21:18,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=108, PETRI_TRANSITIONS=162} [2023-08-31 11:21:18,242 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 22 predicate places. [2023-08-31 11:21:18,242 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 162 transitions, 754 flow [2023-08-31 11:21:18,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:18,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:18,243 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-31 11:21:18,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 11:21:18,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:18,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:18,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1168893095, now seen corresponding path program 1 times [2023-08-31 11:21:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063153520] [2023-08-31 11:21:18,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:18,277 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-31 11:21:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:18,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063153520] [2023-08-31 11:21:18,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063153520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:18,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:18,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 11:21:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228715926] [2023-08-31 11:21:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:18,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:21:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:21:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:21:18,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 368 [2023-08-31 11:21:18,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 162 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:18,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:18,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 368 [2023-08-31 11:21:18,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:22,100 INFO L130 PetriNetUnfolder]: 18376/44283 cut-off events. [2023-08-31 11:21:22,100 INFO L131 PetriNetUnfolder]: For 18993/20588 co-relation queries the response was YES. [2023-08-31 11:21:22,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105788 conditions, 44283 events. 18376/44283 cut-off events. For 18993/20588 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 484067 event pairs, 7154 based on Foata normal form. 490/41372 useless extension candidates. Maximal degree in co-relation 100027. Up to 20278 conditions per place. [2023-08-31 11:21:22,376 INFO L137 encePairwiseOnDemand]: 365/368 looper letters, 92 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2023-08-31 11:21:22,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 204 transitions, 1098 flow [2023-08-31 11:21:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:21:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:21:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-08-31 11:21:22,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6259057971014492 [2023-08-31 11:21:22,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-08-31 11:21:22,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-08-31 11:21:22,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:22,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-08-31 11:21:22,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:22,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:22,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:22,384 INFO L175 Difference]: Start difference. First operand has 108 places, 162 transitions, 754 flow. Second operand 3 states and 691 transitions. [2023-08-31 11:21:22,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 204 transitions, 1098 flow [2023-08-31 11:21:22,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 204 transitions, 1074 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-31 11:21:22,630 INFO L231 Difference]: Finished difference. Result has 111 places, 163 transitions, 742 flow [2023-08-31 11:21:22,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=111, PETRI_TRANSITIONS=163} [2023-08-31 11:21:22,632 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 25 predicate places. [2023-08-31 11:21:22,633 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 163 transitions, 742 flow [2023-08-31 11:21:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:22,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:22,634 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-31 11:21:22,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 11:21:22,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:22,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash 674390040, now seen corresponding path program 1 times [2023-08-31 11:21:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490217392] [2023-08-31 11:21:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:23,305 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-31 11:21:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490217392] [2023-08-31 11:21:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490217392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 11:21:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287470353] [2023-08-31 11:21:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:23,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 11:21:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 11:21:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 11:21:23,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 368 [2023-08-31 11:21:23,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 163 transitions, 742 flow. Second operand has 9 states, 9 states have (on average 196.77777777777777) internal successors, (1771), 9 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:23,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:23,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 368 [2023-08-31 11:21:23,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:38,200 INFO L130 PetriNetUnfolder]: 91276/166025 cut-off events. [2023-08-31 11:21:38,200 INFO L131 PetriNetUnfolder]: For 134720/141613 co-relation queries the response was YES. [2023-08-31 11:21:38,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466088 conditions, 166025 events. 91276/166025 cut-off events. For 134720/141613 co-relation queries the response was YES. Maximal size of possible extension queue 3581. Compared 1709374 event pairs, 23031 based on Foata normal form. 4111/160360 useless extension candidates. Maximal degree in co-relation 463897. Up to 41212 conditions per place. [2023-08-31 11:21:39,383 INFO L137 encePairwiseOnDemand]: 356/368 looper letters, 370 selfloop transitions, 55 changer transitions 0/488 dead transitions. [2023-08-31 11:21:39,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 488 transitions, 2929 flow [2023-08-31 11:21:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 11:21:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 11:21:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2019 transitions. [2023-08-31 11:21:39,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6096014492753623 [2023-08-31 11:21:39,388 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2019 transitions. [2023-08-31 11:21:39,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2019 transitions. [2023-08-31 11:21:39,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:21:39,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2019 transitions. [2023-08-31 11:21:39,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 224.33333333333334) internal successors, (2019), 9 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:39,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:39,398 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:39,398 INFO L175 Difference]: Start difference. First operand has 111 places, 163 transitions, 742 flow. Second operand 9 states and 2019 transitions. [2023-08-31 11:21:39,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 488 transitions, 2929 flow [2023-08-31 11:21:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 488 transitions, 2919 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 11:21:44,154 INFO L231 Difference]: Finished difference. Result has 124 places, 203 transitions, 1256 flow [2023-08-31 11:21:44,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1256, PETRI_PLACES=124, PETRI_TRANSITIONS=203} [2023-08-31 11:21:44,155 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 38 predicate places. [2023-08-31 11:21:44,155 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 203 transitions, 1256 flow [2023-08-31 11:21:44,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 196.77777777777777) internal successors, (1771), 9 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:44,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:21:44,156 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-31 11:21:44,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 11:21:44,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:21:44,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:21:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -456066990, now seen corresponding path program 2 times [2023-08-31 11:21:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:21:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397498192] [2023-08-31 11:21:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:21:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:21:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:21:44,565 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-31 11:21:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:21:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397498192] [2023-08-31 11:21:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397498192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:21:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:21:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 11:21:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965463508] [2023-08-31 11:21:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:21:44,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 11:21:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:21:44,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 11:21:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 11:21:44,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 368 [2023-08-31 11:21:44,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 203 transitions, 1256 flow. Second operand has 9 states, 9 states have (on average 197.77777777777777) internal successors, (1780), 9 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:21:44,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:21:44,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 368 [2023-08-31 11:21:44,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:21:58,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([681] L950-4-->L950-6: Formula: (= |v_t2Thread1of1ForFork1_dec_top_#t~nondet34#1_17| |v_#race~top~0_27|) InVars {} OutVars{#race~top~0=|v_#race~top~0_27|, t2Thread1of1ForFork1_dec_top_#t~nondet34#1=|v_t2Thread1of1ForFork1_dec_top_#t~nondet34#1_17|} AuxVars[] AssignedVars[#race~top~0, t2Thread1of1ForFork1_dec_top_#t~nondet34#1][355], [Black: 255#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), 189#L1025-6true, Black: 257#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 3 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 2 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), Black: 254#(= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))), 314#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (= 3 |~#arr~0.base|)), Black: 256#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 2 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), Black: 265#(= 0 |t1Thread1of1ForFork0_~i~0#1|), 239#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), t2Thread1of1ForFork1InUse, Black: 278#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), 120#L946-2true, Black: 271#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 224#(= |#race~top~0| 0), 9#L950-6true, Black: 286#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 284#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 230#(= |#race~flag~0| 0), 252#true, Black: 236#(= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0), Black: 238#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), Black: 234#true, Black: 237#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), 282#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 248#(= ~top~0 0)]) [2023-08-31 11:21:58,980 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-31 11:21:58,980 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 11:21:58,980 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 11:21:58,980 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-31 11:22:04,171 INFO L130 PetriNetUnfolder]: 111377/198547 cut-off events. [2023-08-31 11:22:04,171 INFO L131 PetriNetUnfolder]: For 366871/376916 co-relation queries the response was YES. [2023-08-31 11:22:05,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647178 conditions, 198547 events. 111377/198547 cut-off events. For 366871/376916 co-relation queries the response was YES. Maximal size of possible extension queue 3758. Compared 2012814 event pairs, 18910 based on Foata normal form. 8520/196176 useless extension candidates. Maximal degree in co-relation 645614. Up to 54967 conditions per place. [2023-08-31 11:22:06,100 INFO L137 encePairwiseOnDemand]: 360/368 looper letters, 354 selfloop transitions, 53 changer transitions 0/470 dead transitions. [2023-08-31 11:22:06,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 470 transitions, 3359 flow [2023-08-31 11:22:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 11:22:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 11:22:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1977 transitions. [2023-08-31 11:22:06,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5969202898550725 [2023-08-31 11:22:06,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1977 transitions. [2023-08-31 11:22:06,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1977 transitions. [2023-08-31 11:22:06,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:22:06,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1977 transitions. [2023-08-31 11:22:06,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 219.66666666666666) internal successors, (1977), 9 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:22:06,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:22:06,116 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:22:06,116 INFO L175 Difference]: Start difference. First operand has 124 places, 203 transitions, 1256 flow. Second operand 9 states and 1977 transitions. [2023-08-31 11:22:06,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 470 transitions, 3359 flow [2023-08-31 11:22:44,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 470 transitions, 3348 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 11:22:44,306 INFO L231 Difference]: Finished difference. Result has 138 places, 246 transitions, 1907 flow [2023-08-31 11:22:44,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1907, PETRI_PLACES=138, PETRI_TRANSITIONS=246} [2023-08-31 11:22:44,307 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 52 predicate places. [2023-08-31 11:22:44,307 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 246 transitions, 1907 flow [2023-08-31 11:22:44,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 197.77777777777777) internal successors, (1780), 9 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:22:44,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:22:44,308 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-31 11:22:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 11:22:44,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:22:44,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:22:44,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1772551212, now seen corresponding path program 1 times [2023-08-31 11:22:44,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:22:44,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968266214] [2023-08-31 11:22:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:22:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:22:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:22:44,667 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-31 11:22:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:22:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968266214] [2023-08-31 11:22:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968266214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:22:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:22:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 11:22:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961798259] [2023-08-31 11:22:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:22:44,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 11:22:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:22:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 11:22:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 11:22:44,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 368 [2023-08-31 11:22:44,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 246 transitions, 1907 flow. Second operand has 9 states, 9 states have (on average 182.77777777777777) internal successors, (1645), 9 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:22:44,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:22:44,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 368 [2023-08-31 11:22:44,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:23:06,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L995-2-->L962-1: Formula: (let ((.cse0 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_In_1| 4294967296))) (and (= (ite (< .cse0 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_2| |v_~#arr~0.offset_In_1|) (= |v_~#arr~0.base_In_1| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_2|) (= (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_t1Thread1of1ForFork0_push_#in~x#1_Out_2|) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_t1Thread1of1ForFork0_push_~x#1_Out_2| |v_t1Thread1of1ForFork0_push_#in~x#1_Out_2|) (= |v_t1Thread1of1ForFork0_push_~stack#1.base_Out_2| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_2|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_2| |v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_2|) (= 0 |v_#race~top~0_Out_2|) (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_1|, ~#arr~0.base=|v_~#arr~0.base_In_1|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_In_1|} OutVars{t1Thread1of1ForFork0_push_#t~nondet35#1=|v_t1Thread1of1ForFork0_push_#t~nondet35#1_Out_2|, ~#arr~0.offset=|v_~#arr~0.offset_In_1|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_Out_2|, t1Thread1of1ForFork0_push_#t~nondet37#1=|v_t1Thread1of1ForFork0_push_#t~nondet37#1_Out_2|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_2|, t1Thread1of1ForFork0_#t~nondet44#1=|v_t1Thread1of1ForFork0_#t~nondet44#1_Out_2|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_Out_2|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_2|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_Out_2|, #race~top~0=|v_#race~top~0_Out_2|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_In_1|, t1Thread1of1ForFork0_push_#t~ret36#1=|v_t1Thread1of1ForFork0_push_#t~ret36#1_Out_2|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_Out_2|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_2|, ~#arr~0.base=|v_~#arr~0.base_In_1|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~nondet35#1, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_push_#t~nondet37#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_#t~nondet44#1, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_push_#res#1, #race~top~0, t1Thread1of1ForFork0_push_#t~ret36#1, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1][414], [Black: 312#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (= 3 |~#arr~0.base|)), Black: 296#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= 3 |~#arr~0.base|)), Black: 306#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= 3 |~#arr~0.base|)), 24#L962-1true, Black: 255#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), 189#L1025-6true, 323#true, Black: 257#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 3 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 2 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), Black: 254#(= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))), 314#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (= 3 |~#arr~0.base|)), Black: 256#(and (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset| 1))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (= |t1Thread1of1ForFork0_push_#t~nondet37#1| (select (select |#race| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ 2 (* |t1Thread1of1ForFork0_push_#t~ret36#1| 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))), Black: 265#(= 0 |t1Thread1of1ForFork0_~i~0#1|), 239#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), t2Thread1of1ForFork1InUse, Black: 278#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 271#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 282#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 222#true, Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 284#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), Black: 230#(= |#race~flag~0| 0), 286#(and (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (not (= |ULTIMATE.start_main_~#id1~0#1.base| |~#arr~0.base|))), 252#true, Black: 236#(= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0), Black: 238#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), Black: 234#true, Black: 237#(and (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)), 78#L950-2true, Black: 248#(= ~top~0 0), Black: 310#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= 0 (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#id1~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#id1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (= 3 |~#arr~0.base|)), Black: 308#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) |ULTIMATE.start_main_~#id1~0#1.offset|) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#id1~0#1.base|) (+ |ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (= 3 |~#arr~0.base|)), Black: 304#(and (not (= 3 |ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |ULTIMATE.start_main_~#id1~0#1.base|)) (= 3 |~#arr~0.base|))]) [2023-08-31 11:23:06,162 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2023-08-31 11:23:06,162 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-31 11:23:06,162 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-08-31 11:23:06,162 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-31 11:23:09,788 INFO L130 PetriNetUnfolder]: 118637/217698 cut-off events. [2023-08-31 11:23:09,789 INFO L131 PetriNetUnfolder]: For 718148/720337 co-relation queries the response was YES. [2023-08-31 11:23:11,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769399 conditions, 217698 events. 118637/217698 cut-off events. For 718148/720337 co-relation queries the response was YES. Maximal size of possible extension queue 4090. Compared 2277555 event pairs, 37512 based on Foata normal form. 378/206060 useless extension candidates. Maximal degree in co-relation 767828. Up to 143275 conditions per place. [2023-08-31 11:23:12,244 INFO L137 encePairwiseOnDemand]: 359/368 looper letters, 396 selfloop transitions, 56 changer transitions 0/502 dead transitions. [2023-08-31 11:23:12,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 502 transitions, 4700 flow [2023-08-31 11:23:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 11:23:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 11:23:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1825 transitions. [2023-08-31 11:23:12,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510265700483091 [2023-08-31 11:23:12,248 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1825 transitions. [2023-08-31 11:23:12,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1825 transitions. [2023-08-31 11:23:12,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:23:12,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1825 transitions. [2023-08-31 11:23:12,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.77777777777777) internal successors, (1825), 9 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:23:12,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:23:12,257 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:23:12,257 INFO L175 Difference]: Start difference. First operand has 138 places, 246 transitions, 1907 flow. Second operand 9 states and 1825 transitions. [2023-08-31 11:23:12,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 502 transitions, 4700 flow [2023-08-31 11:23:44,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 502 transitions, 4695 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 11:23:44,892 INFO L231 Difference]: Finished difference. Result has 151 places, 295 transitions, 2686 flow [2023-08-31 11:23:44,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2686, PETRI_PLACES=151, PETRI_TRANSITIONS=295} [2023-08-31 11:23:44,893 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 65 predicate places. [2023-08-31 11:23:44,894 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 295 transitions, 2686 flow [2023-08-31 11:23:44,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 182.77777777777777) internal successors, (1645), 9 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:23:44,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:23:44,895 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-31 11:23:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 11:23:44,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2023-08-31 11:23:44,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:23:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1537194966, now seen corresponding path program 3 times [2023-08-31 11:23:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:23:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119878430] [2023-08-31 11:23:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:23:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:23:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:23:45,439 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-31 11:23:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:23:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119878430] [2023-08-31 11:23:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119878430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:23:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:23:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 11:23:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050089871] [2023-08-31 11:23:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:23:45,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 11:23:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:23:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 11:23:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 11:23:45,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 368 [2023-08-31 11:23:45,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 295 transitions, 2686 flow. Second operand has 10 states, 10 states have (on average 191.6) internal successors, (1916), 10 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:23:45,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:23:45,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 368 [2023-08-31 11:23:45,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand