./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:17:34,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:17:34,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:17:34,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:17:34,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:17:34,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:17:34,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:17:34,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:17:34,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:17:34,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:17:34,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:17:34,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:17:34,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:17:34,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:17:34,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:17:34,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:17:34,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:17:34,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:17:34,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:17:34,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:17:34,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:17:34,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:17:34,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:17:34,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:17:34,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:17:34,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:17:34,951 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b [2024-11-07 15:17:35,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:17:35,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:17:35,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:17:35,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:17:35,273 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:17:35,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2024-11-07 15:17:36,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:17:36,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:17:36,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2024-11-07 15:17:36,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ce506cb4/5f004c9a28ee4d56aa4921baae51349c/FLAG169ec1fb7 [2024-11-07 15:17:37,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ce506cb4/5f004c9a28ee4d56aa4921baae51349c [2024-11-07 15:17:37,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:17:37,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:17:37,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:17:37,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:17:37,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:17:37,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@faef39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37, skipping insertion in model container [2024-11-07 15:17:37,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:17:37,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:17:37,537 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:17:37,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:17:37,638 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:17:37,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37 WrapperNode [2024-11-07 15:17:37,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:17:37,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:17:37,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:17:37,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:17:37,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,737 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 934 [2024-11-07 15:17:37,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:17:37,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:17:37,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:17:37,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:17:37,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:17:37,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:17:37,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:17:37,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:17:37,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (1/1) ... [2024-11-07 15:17:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:17:37,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:17:37,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:17:37,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:17:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:17:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-07 15:17:37,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-07 15:17:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:17:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:17:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:17:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:17:37,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:17:37,928 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:17:38,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:17:38,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:17:39,159 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:17:39,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:17:39,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:17:39,542 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 15:17:39,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:17:39 BoogieIcfgContainer [2024-11-07 15:17:39,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:17:39,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:17:39,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:17:39,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:17:39,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:17:37" (1/3) ... [2024-11-07 15:17:39,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0c6e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:17:39, skipping insertion in model container [2024-11-07 15:17:39,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:17:37" (2/3) ... [2024-11-07 15:17:39,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0c6e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:17:39, skipping insertion in model container [2024-11-07 15:17:39,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:17:39" (3/3) ... [2024-11-07 15:17:39,556 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-1-race.i [2024-11-07 15:17:39,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:17:39,584 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-07 15:17:39,584 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:17:39,696 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:17:39,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 796 places, 800 transitions, 1604 flow [2024-11-07 15:17:40,053 INFO L124 PetriNetUnfolderBase]: 8/809 cut-off events. [2024-11-07 15:17:40,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:17:40,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 809 events. 8/809 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 234 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 668. Up to 4 conditions per place. [2024-11-07 15:17:40,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 796 places, 800 transitions, 1604 flow [2024-11-07 15:17:40,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 796 places, 800 transitions, 1604 flow [2024-11-07 15:17:40,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:17:40,102 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@25acda42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:17:40,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-07 15:17:40,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:17:40,233 INFO L124 PetriNetUnfolderBase]: 1/671 cut-off events. [2024-11-07 15:17:40,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:17:40,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:40,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:40,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-07 15:17:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1256575656, now seen corresponding path program 1 times [2024-11-07 15:17:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550620912] [2024-11-07 15:17:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550620912] [2024-11-07 15:17:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550620912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:43,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 15:17:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273182708] [2024-11-07 15:17:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:43,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:17:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:17:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:17:43,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 772 out of 800 [2024-11-07 15:17:43,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 800 transitions, 1604 flow. Second operand has 2 states, 2 states have (on average 773.0) internal successors, (1546), 2 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:43,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:43,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 772 of 800 [2024-11-07 15:17:43,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:43,689 INFO L124 PetriNetUnfolderBase]: 4/781 cut-off events. [2024-11-07 15:17:43,689 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:17:43,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 781 events. 4/781 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 8/774 useless extension candidates. Maximal degree in co-relation 124. Up to 10 conditions per place. [2024-11-07 15:17:43,693 INFO L140 encePairwiseOnDemand]: 781/800 looper letters, 9 selfloop transitions, 0 changer transitions 0/777 dead transitions. [2024-11-07 15:17:43,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 777 transitions, 1576 flow [2024-11-07 15:17:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:17:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:17:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1572 transitions. [2024-11-07 15:17:43,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9825 [2024-11-07 15:17:43,720 INFO L175 Difference]: Start difference. First operand has 796 places, 800 transitions, 1604 flow. Second operand 2 states and 1572 transitions. [2024-11-07 15:17:43,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 777 transitions, 1576 flow [2024-11-07 15:17:43,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 777 transitions, 1576 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:17:43,751 INFO L231 Difference]: Finished difference. Result has 777 places, 777 transitions, 1558 flow [2024-11-07 15:17:43,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=800, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1558, PETRI_PLACES=777, PETRI_TRANSITIONS=777} [2024-11-07 15:17:43,759 INFO L277 CegarLoopForPetriNet]: 796 programPoint places, -19 predicate places. [2024-11-07 15:17:43,760 INFO L471 AbstractCegarLoop]: Abstraction has has 777 places, 777 transitions, 1558 flow [2024-11-07 15:17:43,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 773.0) internal successors, (1546), 2 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:43,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:43,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:17:43,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-07 15:17:43,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 683465963, now seen corresponding path program 1 times [2024-11-07 15:17:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417989580] [2024-11-07 15:17:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417989580] [2024-11-07 15:17:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417989580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:17:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383079333] [2024-11-07 15:17:44,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:44,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:17:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:44,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:17:44,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:17:44,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 768 out of 800 [2024-11-07 15:17:44,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 777 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:44,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:44,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 768 of 800 [2024-11-07 15:17:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:44,570 INFO L124 PetriNetUnfolderBase]: 6/869 cut-off events. [2024-11-07 15:17:44,570 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:17:44,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 869 events. 6/869 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 890. Up to 11 conditions per place. [2024-11-07 15:17:44,573 INFO L140 encePairwiseOnDemand]: 797/800 looper letters, 17 selfloop transitions, 2 changer transitions 0/783 dead transitions. [2024-11-07 15:17:44,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 783 transitions, 1608 flow [2024-11-07 15:17:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:17:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:17:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2324 transitions. [2024-11-07 15:17:44,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683333333333334 [2024-11-07 15:17:44,583 INFO L175 Difference]: Start difference. First operand has 777 places, 777 transitions, 1558 flow. Second operand 3 states and 2324 transitions. [2024-11-07 15:17:44,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 783 transitions, 1608 flow [2024-11-07 15:17:44,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 783 transitions, 1608 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:17:44,602 INFO L231 Difference]: Finished difference. Result has 778 places, 776 transitions, 1560 flow [2024-11-07 15:17:44,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=800, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=778, PETRI_TRANSITIONS=776} [2024-11-07 15:17:44,604 INFO L277 CegarLoopForPetriNet]: 796 programPoint places, -18 predicate places. [2024-11-07 15:17:44,604 INFO L471 AbstractCegarLoop]: Abstraction has has 778 places, 776 transitions, 1560 flow [2024-11-07 15:17:44,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:44,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:44,607 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:44,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:17:44,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-11-07 15:17:44,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -554793806, now seen corresponding path program 1 times [2024-11-07 15:17:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186416773] [2024-11-07 15:17:44,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:17:44,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:17:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:17:45,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:17:45,263 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:17:45,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2024-11-07 15:17:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2024-11-07 15:17:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2024-11-07 15:17:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2024-11-07 15:17:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2024-11-07 15:17:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2024-11-07 15:17:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2024-11-07 15:17:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2024-11-07 15:17:45,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2024-11-07 15:17:45,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2024-11-07 15:17:45,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2024-11-07 15:17:45,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2024-11-07 15:17:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:17:45,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 15:17:45,273 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:17:45,273 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:17:45,379 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:17:45,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 921 places, 929 transitions, 1868 flow [2024-11-07 15:17:45,645 INFO L124 PetriNetUnfolderBase]: 15/949 cut-off events. [2024-11-07 15:17:45,646 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:17:45,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 949 events. 15/949 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 873 event pairs, 0 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 810. Up to 6 conditions per place. [2024-11-07 15:17:45,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 921 places, 929 transitions, 1868 flow [2024-11-07 15:17:45,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 921 places, 929 transitions, 1868 flow [2024-11-07 15:17:45,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:17:45,665 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@25acda42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:17:45,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-07 15:17:45,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:17:45,750 INFO L124 PetriNetUnfolderBase]: 1/671 cut-off events. [2024-11-07 15:17:45,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:17:45,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:45,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:45,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-07 15:17:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 857497800, now seen corresponding path program 1 times [2024-11-07 15:17:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:45,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019728838] [2024-11-07 15:17:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019728838] [2024-11-07 15:17:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019728838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 15:17:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166552874] [2024-11-07 15:17:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:17:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:17:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:17:47,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 875 out of 929 [2024-11-07 15:17:47,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 929 transitions, 1868 flow. Second operand has 2 states, 2 states have (on average 876.0) internal successors, (1752), 2 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:47,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:47,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 875 of 929 [2024-11-07 15:17:47,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:48,680 INFO L124 PetriNetUnfolderBase]: 112/1924 cut-off events. [2024-11-07 15:17:48,681 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-07 15:17:48,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1924 events. 112/1924 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8196 event pairs, 52 based on Foata normal form. 89/1840 useless extension candidates. Maximal degree in co-relation 1281. Up to 161 conditions per place. [2024-11-07 15:17:48,700 INFO L140 encePairwiseOnDemand]: 893/929 looper letters, 18 selfloop transitions, 0 changer transitions 0/888 dead transitions. [2024-11-07 15:17:48,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 886 places, 888 transitions, 1822 flow [2024-11-07 15:17:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:17:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:17:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1804 transitions. [2024-11-07 15:17:48,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9709364908503767 [2024-11-07 15:17:48,705 INFO L175 Difference]: Start difference. First operand has 921 places, 929 transitions, 1868 flow. Second operand 2 states and 1804 transitions. [2024-11-07 15:17:48,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 886 places, 888 transitions, 1822 flow [2024-11-07 15:17:48,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 888 transitions, 1822 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:17:48,725 INFO L231 Difference]: Finished difference. Result has 886 places, 888 transitions, 1786 flow [2024-11-07 15:17:48,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=929, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1786, PETRI_PLACES=886, PETRI_TRANSITIONS=888} [2024-11-07 15:17:48,728 INFO L277 CegarLoopForPetriNet]: 921 programPoint places, -35 predicate places. [2024-11-07 15:17:48,728 INFO L471 AbstractCegarLoop]: Abstraction has has 886 places, 888 transitions, 1786 flow [2024-11-07 15:17:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 876.0) internal successors, (1752), 2 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:48,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:48,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:17:48,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-07 15:17:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash -578230485, now seen corresponding path program 1 times [2024-11-07 15:17:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663395306] [2024-11-07 15:17:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663395306] [2024-11-07 15:17:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663395306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:49,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:17:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836661865] [2024-11-07 15:17:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:49,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:17:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:17:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:17:49,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 867 out of 929 [2024-11-07 15:17:49,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 888 transitions, 1786 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:49,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:49,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 867 of 929 [2024-11-07 15:17:49,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:50,723 INFO L124 PetriNetUnfolderBase]: 368/4264 cut-off events. [2024-11-07 15:17:50,724 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-07 15:17:50,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4893 conditions, 4264 events. 368/4264 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 32503 event pairs, 99 based on Foata normal form. 0/3785 useless extension candidates. Maximal degree in co-relation 4888. Up to 293 conditions per place. [2024-11-07 15:17:50,776 INFO L140 encePairwiseOnDemand]: 921/929 looper letters, 43 selfloop transitions, 6 changer transitions 0/911 dead transitions. [2024-11-07 15:17:50,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 911 transitions, 1935 flow [2024-11-07 15:17:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:17:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:17:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2652 transitions. [2024-11-07 15:17:50,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9515608180839612 [2024-11-07 15:17:50,783 INFO L175 Difference]: Start difference. First operand has 886 places, 888 transitions, 1786 flow. Second operand 3 states and 2652 transitions. [2024-11-07 15:17:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 911 transitions, 1935 flow [2024-11-07 15:17:50,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 888 places, 911 transitions, 1935 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:17:50,801 INFO L231 Difference]: Finished difference. Result has 890 places, 894 transitions, 1838 flow [2024-11-07 15:17:50,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=929, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=886, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1838, PETRI_PLACES=890, PETRI_TRANSITIONS=894} [2024-11-07 15:17:50,803 INFO L277 CegarLoopForPetriNet]: 921 programPoint places, -31 predicate places. [2024-11-07 15:17:50,803 INFO L471 AbstractCegarLoop]: Abstraction has has 890 places, 894 transitions, 1838 flow [2024-11-07 15:17:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:50,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:50,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:17:50,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-07 15:17:50,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -794282810, now seen corresponding path program 1 times [2024-11-07 15:17:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157225861] [2024-11-07 15:17:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157225861] [2024-11-07 15:17:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157225861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:17:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660681131] [2024-11-07 15:17:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:17:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:17:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:17:51,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 863 out of 929 [2024-11-07 15:17:51,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 890 places, 894 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 865.0) internal successors, (2595), 3 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:51,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:51,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 863 of 929 [2024-11-07 15:17:51,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:52,618 INFO L124 PetriNetUnfolderBase]: 674/5472 cut-off events. [2024-11-07 15:17:52,619 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-07 15:17:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6728 conditions, 5472 events. 674/5472 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 45660 event pairs, 283 based on Foata normal form. 0/4809 useless extension candidates. Maximal degree in co-relation 6721. Up to 992 conditions per place. [2024-11-07 15:17:52,666 INFO L140 encePairwiseOnDemand]: 921/929 looper letters, 37 selfloop transitions, 7 changer transitions 0/908 dead transitions. [2024-11-07 15:17:52,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 892 places, 908 transitions, 1959 flow [2024-11-07 15:17:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:17:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:17:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2634 transitions. [2024-11-07 15:17:52,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9451022604951561 [2024-11-07 15:17:52,674 INFO L175 Difference]: Start difference. First operand has 890 places, 894 transitions, 1838 flow. Second operand 3 states and 2634 transitions. [2024-11-07 15:17:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 892 places, 908 transitions, 1959 flow [2024-11-07 15:17:52,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 908 transitions, 1947 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:17:52,691 INFO L231 Difference]: Finished difference. Result has 892 places, 900 transitions, 1880 flow [2024-11-07 15:17:52,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=929, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1880, PETRI_PLACES=892, PETRI_TRANSITIONS=900} [2024-11-07 15:17:52,694 INFO L277 CegarLoopForPetriNet]: 921 programPoint places, -29 predicate places. [2024-11-07 15:17:52,695 INFO L471 AbstractCegarLoop]: Abstraction has has 892 places, 900 transitions, 1880 flow [2024-11-07 15:17:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 865.0) internal successors, (2595), 3 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:52,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:52,698 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:52,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:17:52,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-07 15:17:52,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1314679397, now seen corresponding path program 1 times [2024-11-07 15:17:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690976219] [2024-11-07 15:17:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:17:52,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:17:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:17:53,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:17:53,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:17:53,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2024-11-07 15:17:53,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2024-11-07 15:17:53,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2024-11-07 15:17:53,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2024-11-07 15:17:53,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2024-11-07 15:17:53,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2024-11-07 15:17:53,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2024-11-07 15:17:53,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2024-11-07 15:17:53,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2024-11-07 15:17:53,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2024-11-07 15:17:53,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2024-11-07 15:17:53,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2024-11-07 15:17:53,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2024-11-07 15:17:53,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2024-11-07 15:17:53,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2024-11-07 15:17:53,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2024-11-07 15:17:53,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2024-11-07 15:17:53,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:17:53,147 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 15:17:53,148 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:17:53,148 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:17:53,261 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:17:53,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1046 places, 1058 transitions, 2134 flow [2024-11-07 15:17:53,626 INFO L124 PetriNetUnfolderBase]: 22/1089 cut-off events. [2024-11-07 15:17:53,626 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 15:17:53,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 1089 events. 22/1089 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1690 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 953. Up to 8 conditions per place. [2024-11-07 15:17:53,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 1046 places, 1058 transitions, 2134 flow [2024-11-07 15:17:53,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1046 places, 1058 transitions, 2134 flow [2024-11-07 15:17:53,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:17:53,649 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@25acda42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:17:53,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2024-11-07 15:17:53,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:17:53,716 INFO L124 PetriNetUnfolderBase]: 1/671 cut-off events. [2024-11-07 15:17:53,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:17:53,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:53,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:53,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-07 15:17:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1373857928, now seen corresponding path program 1 times [2024-11-07 15:17:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882586176] [2024-11-07 15:17:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882586176] [2024-11-07 15:17:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882586176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:55,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 15:17:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070994083] [2024-11-07 15:17:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:55,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:17:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:17:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:17:55,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 978 out of 1058 [2024-11-07 15:17:55,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1058 transitions, 2134 flow. Second operand has 2 states, 2 states have (on average 979.0) internal successors, (1958), 2 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:55,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:55,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 978 of 1058 [2024-11-07 15:17:55,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:17:58,643 INFO L124 PetriNetUnfolderBase]: 1750/12834 cut-off events. [2024-11-07 15:17:58,643 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-11-07 15:17:58,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15307 conditions, 12834 events. 1750/12834 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 137542 event pairs, 962 based on Foata normal form. 959/12210 useless extension candidates. Maximal degree in co-relation 12831. Up to 2202 conditions per place. [2024-11-07 15:17:58,784 INFO L140 encePairwiseOnDemand]: 1005/1058 looper letters, 27 selfloop transitions, 0 changer transitions 0/999 dead transitions. [2024-11-07 15:17:58,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 999 transitions, 2070 flow [2024-11-07 15:17:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:17:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:17:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2036 transitions. [2024-11-07 15:17:58,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621928166351607 [2024-11-07 15:17:58,790 INFO L175 Difference]: Start difference. First operand has 1046 places, 1058 transitions, 2134 flow. Second operand 2 states and 2036 transitions. [2024-11-07 15:17:58,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 999 transitions, 2070 flow [2024-11-07 15:17:58,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 999 transitions, 2068 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-07 15:17:58,804 INFO L231 Difference]: Finished difference. Result has 995 places, 999 transitions, 2014 flow [2024-11-07 15:17:58,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1058, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2014, PETRI_PLACES=995, PETRI_TRANSITIONS=999} [2024-11-07 15:17:58,808 INFO L277 CegarLoopForPetriNet]: 1046 programPoint places, -51 predicate places. [2024-11-07 15:17:58,808 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 999 transitions, 2014 flow [2024-11-07 15:17:58,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 979.0) internal successors, (1958), 2 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:58,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:17:58,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:17:58,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:17:58,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-07 15:17:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:17:58,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1722647339, now seen corresponding path program 1 times [2024-11-07 15:17:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:17:58,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678258796] [2024-11-07 15:17:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:17:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:17:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:17:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:17:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:17:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678258796] [2024-11-07 15:17:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678258796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:17:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:17:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:17:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635804946] [2024-11-07 15:17:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:17:59,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:17:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:17:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:17:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:17:59,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 966 out of 1058 [2024-11-07 15:17:59,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 999 transitions, 2014 flow. Second operand has 3 states, 3 states have (on average 967.3333333333334) internal successors, (2902), 3 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:17:59,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:17:59,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 966 of 1058 [2024-11-07 15:17:59,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:18:10,914 INFO L124 PetriNetUnfolderBase]: 9392/56627 cut-off events. [2024-11-07 15:18:10,914 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2024-11-07 15:18:11,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69834 conditions, 56627 events. 9392/56627 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 828571 event pairs, 2763 based on Foata normal form. 0/49138 useless extension candidates. Maximal degree in co-relation 69828. Up to 6318 conditions per place. [2024-11-07 15:18:11,653 INFO L140 encePairwiseOnDemand]: 1046/1058 looper letters, 65 selfloop transitions, 9 changer transitions 0/1034 dead transitions. [2024-11-07 15:18:11,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1034 transitions, 2242 flow [2024-11-07 15:18:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:18:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:18:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2975 transitions. [2024-11-07 15:18:11,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373030875866415 [2024-11-07 15:18:11,662 INFO L175 Difference]: Start difference. First operand has 995 places, 999 transitions, 2014 flow. Second operand 3 states and 2975 transitions. [2024-11-07 15:18:11,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 1034 transitions, 2242 flow [2024-11-07 15:18:11,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 1034 transitions, 2242 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:18:11,677 INFO L231 Difference]: Finished difference. Result has 999 places, 1008 transitions, 2092 flow [2024-11-07 15:18:11,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1058, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=999, PETRI_TRANSITIONS=1008} [2024-11-07 15:18:11,680 INFO L277 CegarLoopForPetriNet]: 1046 programPoint places, -47 predicate places. [2024-11-07 15:18:11,680 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1008 transitions, 2092 flow [2024-11-07 15:18:11,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 967.3333333333334) internal successors, (2902), 3 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:18:11,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:18:11,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:18:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:18:11,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-11-07 15:18:11,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:18:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1754114008, now seen corresponding path program 1 times [2024-11-07 15:18:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:18:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286932793] [2024-11-07 15:18:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:18:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:18:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:18:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:18:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:18:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286932793] [2024-11-07 15:18:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286932793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:18:11,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:18:11,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:18:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009361328] [2024-11-07 15:18:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:18:11,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:18:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:18:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:18:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:18:12,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 963 out of 1058 [2024-11-07 15:18:12,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1008 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 965.0) internal successors, (2895), 3 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:18:12,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:18:12,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 963 of 1058 [2024-11-07 15:18:12,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:18:15,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [147#L766-3true, 1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 1056#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:15,545 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2024-11-07 15:18:15,545 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2024-11-07 15:18:15,545 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2024-11-07 15:18:15,545 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2024-11-07 15:18:15,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [147#L766-3true, 1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 1049#true, 1043#true, 1056#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:15,673 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2024-11-07 15:18:15,673 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2024-11-07 15:18:15,673 INFO L297 olderBase$Statistics]: existing Event has 720 ancestors and is cut-off event [2024-11-07 15:18:15,673 INFO L297 olderBase$Statistics]: existing Event has 720 ancestors and is cut-off event [2024-11-07 15:18:19,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 717#L705-3true, 1049#true, 1043#true, 1056#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:19,094 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2024-11-07 15:18:19,094 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2024-11-07 15:18:19,094 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2024-11-07 15:18:19,094 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2024-11-07 15:18:19,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 717#L705-3true, 386#L764true, 1049#true, 1043#true, 1056#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:19,437 INFO L294 olderBase$Statistics]: this new event has 748 ancestors and is cut-off event [2024-11-07 15:18:19,437 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2024-11-07 15:18:19,437 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2024-11-07 15:18:19,437 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2024-11-07 15:18:20,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 500#L716true, 1047#true, 925#L707-3true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 1043#true, 1056#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:20,036 INFO L294 olderBase$Statistics]: this new event has 751 ancestors and is cut-off event [2024-11-07 15:18:20,036 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2024-11-07 15:18:20,036 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2024-11-07 15:18:20,036 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2024-11-07 15:18:20,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 1047#true, 925#L707-3true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 1056#true, 1049#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:20,445 INFO L294 olderBase$Statistics]: this new event has 752 ancestors and is cut-off event [2024-11-07 15:18:20,445 INFO L297 olderBase$Statistics]: existing Event has 752 ancestors and is cut-off event [2024-11-07 15:18:20,445 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2024-11-07 15:18:20,445 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2024-11-07 15:18:23,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [417#L732-3true, 1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 1043#true, 1056#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:23,936 INFO L294 olderBase$Statistics]: this new event has 765 ancestors and is cut-off event [2024-11-07 15:18:23,936 INFO L297 olderBase$Statistics]: existing Event has 754 ancestors and is cut-off event [2024-11-07 15:18:23,936 INFO L297 olderBase$Statistics]: existing Event has 754 ancestors and is cut-off event [2024-11-07 15:18:23,936 INFO L297 olderBase$Statistics]: existing Event has 765 ancestors and is cut-off event [2024-11-07 15:18:24,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [417#L732-3true, 1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 1056#true, 1049#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:24,106 INFO L294 olderBase$Statistics]: this new event has 766 ancestors and is cut-off event [2024-11-07 15:18:24,106 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2024-11-07 15:18:24,106 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2024-11-07 15:18:24,106 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2024-11-07 15:18:24,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 1056#true, 306#L733true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:24,110 INFO L294 olderBase$Statistics]: this new event has 766 ancestors and is cut-off event [2024-11-07 15:18:24,110 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2024-11-07 15:18:24,110 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2024-11-07 15:18:24,110 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2024-11-07 15:18:24,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 306#L733true, 1049#true, 1056#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:24,284 INFO L294 olderBase$Statistics]: this new event has 767 ancestors and is cut-off event [2024-11-07 15:18:24,284 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2024-11-07 15:18:24,284 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2024-11-07 15:18:24,284 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2024-11-07 15:18:26,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [461#L735-3true, 1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 1056#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:26,461 INFO L294 olderBase$Statistics]: this new event has 776 ancestors and is cut-off event [2024-11-07 15:18:26,461 INFO L297 olderBase$Statistics]: existing Event has 776 ancestors and is cut-off event [2024-11-07 15:18:26,461 INFO L297 olderBase$Statistics]: existing Event has 765 ancestors and is cut-off event [2024-11-07 15:18:26,461 INFO L297 olderBase$Statistics]: existing Event has 765 ancestors and is cut-off event [2024-11-07 15:18:26,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [461#L735-3true, 1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 1056#true, 1049#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:26,715 INFO L294 olderBase$Statistics]: this new event has 777 ancestors and is cut-off event [2024-11-07 15:18:26,715 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2024-11-07 15:18:26,715 INFO L297 olderBase$Statistics]: existing Event has 777 ancestors and is cut-off event [2024-11-07 15:18:26,715 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2024-11-07 15:18:27,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 500#L716true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 1049#true, 724#L736-3true, 1056#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:27,349 INFO L294 olderBase$Statistics]: this new event has 779 ancestors and is cut-off event [2024-11-07 15:18:27,349 INFO L297 olderBase$Statistics]: existing Event has 779 ancestors and is cut-off event [2024-11-07 15:18:27,349 INFO L297 olderBase$Statistics]: existing Event has 768 ancestors and is cut-off event [2024-11-07 15:18:27,349 INFO L297 olderBase$Statistics]: existing Event has 768 ancestors and is cut-off event [2024-11-07 15:18:27,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4151] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][765], [1051#true, 1047#true, 888#L775-6true, 1045#true, 655#L766-3true, 386#L764true, 1049#true, 724#L736-3true, 1056#true, 1043#true, Black: 1053#(= |#race~state~0| 0)]) [2024-11-07 15:18:27,518 INFO L294 olderBase$Statistics]: this new event has 780 ancestors and is cut-off event [2024-11-07 15:18:27,518 INFO L297 olderBase$Statistics]: existing Event has 780 ancestors and is cut-off event [2024-11-07 15:18:27,518 INFO L297 olderBase$Statistics]: existing Event has 769 ancestors and is cut-off event [2024-11-07 15:18:27,518 INFO L297 olderBase$Statistics]: existing Event has 769 ancestors and is cut-off event