./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.wvr.c --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/weaver/chl-match-trans.wvr.c', '-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', '58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7'] 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/weaver/chl-match-trans.wvr.c -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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:42:09,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:42:09,327 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:42:09,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:42:09,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:42:09,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:42:09,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:42:09,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:42:09,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:42:09,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:42:09,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:42:09,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:42:09,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:42:09,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:42:09,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:42:09,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:42:09,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:42:09,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:42:09,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:42:09,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:42:09,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:42:09,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:42:09,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:42:09,370 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2024-11-07 15:42:09,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:42:09,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:42:09,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:42:09,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:42:09,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:42:09,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-11-07 15:42:10,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:42:11,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:42:11,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-11-07 15:42:11,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3d1872da/f95fedd05e4d49729be4ca854838d3cb/FLAG43f81d061 [2024-11-07 15:42:11,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3d1872da/f95fedd05e4d49729be4ca854838d3cb [2024-11-07 15:42:11,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:42:11,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:42:11,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:42:11,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:42:11,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:42:11,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f24288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11, skipping insertion in model container [2024-11-07 15:42:11,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:42:11,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:42:11,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:42:11,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:42:11,498 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:42:11,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11 WrapperNode [2024-11-07 15:42:11,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:42:11,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:42:11,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:42:11,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:42:11,505 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:42:11" (1/1) ... [2024-11-07 15:42:11,514 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:42:11" (1/1) ... [2024-11-07 15:42:11,549 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2024-11-07 15:42:11,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:42:11,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:42:11,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:42:11,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:42:11,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:42:11,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:42:11,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:42:11,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:42:11,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (1/1) ... [2024-11-07 15:42:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:42:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:42:11,639 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:42:11,648 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:42:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:42:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:42:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:42:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:42:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:42:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 15:42:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 15:42:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:42:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:42:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:42:11,670 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:42:11,799 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:42:11,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:42:12,308 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:42:12,308 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:42:12,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:42:12,336 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 15:42:12,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:12 BoogieIcfgContainer [2024-11-07 15:42:12,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:42:12,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:42:12,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:42:12,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:42:12,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:42:11" (1/3) ... [2024-11-07 15:42:12,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67698bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:42:12, skipping insertion in model container [2024-11-07 15:42:12,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:11" (2/3) ... [2024-11-07 15:42:12,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67698bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:42:12, skipping insertion in model container [2024-11-07 15:42:12,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:12" (3/3) ... [2024-11-07 15:42:12,347 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2024-11-07 15:42:12,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:42:12,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-07 15:42:12,361 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:42:12,517 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:42:12,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 445 transitions, 911 flow [2024-11-07 15:42:12,755 INFO L124 PetriNetUnfolderBase]: 18/442 cut-off events. [2024-11-07 15:42:12,787 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:42:12,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 18/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-11-07 15:42:12,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 445 transitions, 911 flow [2024-11-07 15:42:12,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 421 transitions, 860 flow [2024-11-07 15:42:12,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:42:12,840 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;@2a9261aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:42:12,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-07 15:42:12,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:42:12,851 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-07 15:42:12,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:42:12,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,852 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] [2024-11-07 15:42:12,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash 390371777, now seen corresponding path program 1 times [2024-11-07 15:42:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794332205] [2024-11-07 15:42:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,007 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:42:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794332205] [2024-11-07 15:42:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794332205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999661063] [2024-11-07 15:42:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-07 15:42:13,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:13,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-07 15:42:13,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,392 INFO L124 PetriNetUnfolderBase]: 20/802 cut-off events. [2024-11-07 15:42:13,393 INFO L125 PetriNetUnfolderBase]: For 26/30 co-relation queries the response was YES. [2024-11-07 15:42:13,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 802 events. 20/802 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2858 event pairs, 12 based on Foata normal form. 75/765 useless extension candidates. Maximal degree in co-relation 704. Up to 38 conditions per place. [2024-11-07 15:42:13,405 INFO L140 encePairwiseOnDemand]: 430/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-11-07 15:42:13,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 408 transitions, 864 flow [2024-11-07 15:42:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-07 15:42:13,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2024-11-07 15:42:13,428 INFO L175 Difference]: Start difference. First operand has 415 places, 421 transitions, 860 flow. Second operand 3 states and 1270 transitions. [2024-11-07 15:42:13,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 408 transitions, 864 flow [2024-11-07 15:42:13,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 408 transitions, 852 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:42:13,446 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 826 flow [2024-11-07 15:42:13,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2024-11-07 15:42:13,455 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -5 predicate places. [2024-11-07 15:42:13,455 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 826 flow [2024-11-07 15:42:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:13,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,456 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] [2024-11-07 15:42:13,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:42:13,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -547964183, now seen corresponding path program 1 times [2024-11-07 15:42:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077314176] [2024-11-07 15:42:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,536 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:42:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077314176] [2024-11-07 15:42:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077314176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786446761] [2024-11-07 15:42:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:13,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:13,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:13,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,717 INFO L124 PetriNetUnfolderBase]: 12/681 cut-off events. [2024-11-07 15:42:13,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:42:13,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 681 events. 12/681 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2562 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 677. Up to 22 conditions per place. [2024-11-07 15:42:13,729 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-11-07 15:42:13,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 407 transitions, 850 flow [2024-11-07 15:42:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:13,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:13,732 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 826 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 407 transitions, 850 flow [2024-11-07 15:42:13,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 407 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:13,767 INFO L231 Difference]: Finished difference. Result has 409 places, 407 transitions, 824 flow [2024-11-07 15:42:13,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=409, PETRI_TRANSITIONS=407} [2024-11-07 15:42:13,768 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -6 predicate places. [2024-11-07 15:42:13,768 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 407 transitions, 824 flow [2024-11-07 15:42:13,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:13,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,770 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] [2024-11-07 15:42:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:42:13,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:13,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1519254541, now seen corresponding path program 1 times [2024-11-07 15:42:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733190176] [2024-11-07 15:42:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,841 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:42:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733190176] [2024-11-07 15:42:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733190176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754533112] [2024-11-07 15:42:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:13,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:13,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:13,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:14,057 INFO L124 PetriNetUnfolderBase]: 12/671 cut-off events. [2024-11-07 15:42:14,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:42:14,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 671 events. 12/671 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2500 event pairs, 5 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2024-11-07 15:42:14,072 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2024-11-07 15:42:14,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 406 transitions, 848 flow [2024-11-07 15:42:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:14,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:14,078 INFO L175 Difference]: Start difference. First operand has 409 places, 407 transitions, 824 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:14,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 406 transitions, 848 flow [2024-11-07 15:42:14,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 406 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:14,088 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 822 flow [2024-11-07 15:42:14,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2024-11-07 15:42:14,089 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -7 predicate places. [2024-11-07 15:42:14,089 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 822 flow [2024-11-07 15:42:14,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:14,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:14,092 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] [2024-11-07 15:42:14,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:42:14,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:14,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 633941745, now seen corresponding path program 1 times [2024-11-07 15:42:14,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:14,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899138706] [2024-11-07 15:42:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:14,174 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:42:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899138706] [2024-11-07 15:42:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899138706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:14,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080169917] [2024-11-07 15:42:14,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:14,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:14,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-07 15:42:14,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:14,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:14,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-07 15:42:14,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:14,468 INFO L124 PetriNetUnfolderBase]: 34/1363 cut-off events. [2024-11-07 15:42:14,468 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-07 15:42:14,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1363 events. 34/1363 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6095 event pairs, 20 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1379. Up to 50 conditions per place. [2024-11-07 15:42:14,482 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2024-11-07 15:42:14,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 405 transitions, 850 flow [2024-11-07 15:42:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-07 15:42:14,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-11-07 15:42:14,486 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 822 flow. Second operand 3 states and 1258 transitions. [2024-11-07 15:42:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 405 transitions, 850 flow [2024-11-07 15:42:14,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 405 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:14,493 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 820 flow [2024-11-07 15:42:14,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-11-07 15:42:14,494 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -8 predicate places. [2024-11-07 15:42:14,494 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 820 flow [2024-11-07 15:42:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:14,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:14,495 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] [2024-11-07 15:42:14,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:42:14,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1120803467, now seen corresponding path program 1 times [2024-11-07 15:42:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987769565] [2024-11-07 15:42:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:14,576 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:42:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987769565] [2024-11-07 15:42:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987769565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:14,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:14,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435043832] [2024-11-07 15:42:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:14,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:14,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:14,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:14,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:14,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:14,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:14,797 INFO L124 PetriNetUnfolderBase]: 16/867 cut-off events. [2024-11-07 15:42:14,798 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-07 15:42:14,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 867 events. 16/867 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3219 event pairs, 7 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 844. Up to 25 conditions per place. [2024-11-07 15:42:14,814 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-11-07 15:42:14,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 844 flow [2024-11-07 15:42:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:14,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:14,820 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 820 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:14,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 844 flow [2024-11-07 15:42:14,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 404 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:14,828 INFO L231 Difference]: Finished difference. Result has 406 places, 404 transitions, 818 flow [2024-11-07 15:42:14,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=406, PETRI_TRANSITIONS=404} [2024-11-07 15:42:14,829 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-11-07 15:42:14,829 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 404 transitions, 818 flow [2024-11-07 15:42:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:14,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:14,830 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] [2024-11-07 15:42:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:42:14,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1040645728, now seen corresponding path program 1 times [2024-11-07 15:42:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352792017] [2024-11-07 15:42:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:14,903 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:42:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352792017] [2024-11-07 15:42:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352792017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:14,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:14,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471235230] [2024-11-07 15:42:14,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:14,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:14,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:14,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:14,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:14,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:14,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:15,111 INFO L124 PetriNetUnfolderBase]: 16/857 cut-off events. [2024-11-07 15:42:15,111 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-07 15:42:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 857 events. 16/857 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3182 event pairs, 7 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-11-07 15:42:15,126 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2024-11-07 15:42:15,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 403 transitions, 842 flow [2024-11-07 15:42:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:15,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:15,129 INFO L175 Difference]: Start difference. First operand has 406 places, 404 transitions, 818 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 403 transitions, 842 flow [2024-11-07 15:42:15,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:15,140 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 816 flow [2024-11-07 15:42:15,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2024-11-07 15:42:15,141 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-07 15:42:15,142 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 816 flow [2024-11-07 15:42:15,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:15,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:15,144 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] [2024-11-07 15:42:15,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:42:15,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 681543619, now seen corresponding path program 1 times [2024-11-07 15:42:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132621232] [2024-11-07 15:42:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:15,215 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:42:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132621232] [2024-11-07 15:42:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132621232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725099781] [2024-11-07 15:42:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:15,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:15,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-11-07 15:42:15,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:15,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:15,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-11-07 15:42:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:15,367 INFO L124 PetriNetUnfolderBase]: 27/638 cut-off events. [2024-11-07 15:42:15,367 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-11-07 15:42:15,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 638 events. 27/638 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 20 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 622. Up to 50 conditions per place. [2024-11-07 15:42:15,377 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:15,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 402 transitions, 844 flow [2024-11-07 15:42:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-07 15:42:15,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-11-07 15:42:15,380 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 816 flow. Second operand 3 states and 1258 transitions. [2024-11-07 15:42:15,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 402 transitions, 844 flow [2024-11-07 15:42:15,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:15,387 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 814 flow [2024-11-07 15:42:15,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2024-11-07 15:42:15,388 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-07 15:42:15,388 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 814 flow [2024-11-07 15:42:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 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:42:15,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:15,389 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] [2024-11-07 15:42:15,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:42:15,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -475369336, now seen corresponding path program 1 times [2024-11-07 15:42:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:15,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482337597] [2024-11-07 15:42:15,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:15,465 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:42:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482337597] [2024-11-07 15:42:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482337597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563239609] [2024-11-07 15:42:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:15,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:15,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:15,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:15,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:15,598 INFO L124 PetriNetUnfolderBase]: 15/673 cut-off events. [2024-11-07 15:42:15,598 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-07 15:42:15,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 673 events. 15/673 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1777 event pairs, 7 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 623. Up to 25 conditions per place. [2024-11-07 15:42:15,607 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-07 15:42:15,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 838 flow [2024-11-07 15:42:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:15,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:15,611 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 814 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:15,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 838 flow [2024-11-07 15:42:15,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:15,618 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 812 flow [2024-11-07 15:42:15,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2024-11-07 15:42:15,619 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-07 15:42:15,620 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 812 flow [2024-11-07 15:42:15,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:15,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:15,621 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] [2024-11-07 15:42:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:42:15,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -968794602, now seen corresponding path program 1 times [2024-11-07 15:42:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800459893] [2024-11-07 15:42:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:15,698 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:42:15,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:15,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800459893] [2024-11-07 15:42:15,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800459893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:15,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:15,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140909095] [2024-11-07 15:42:15,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:15,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:15,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:15,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:15,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-11-07 15:42:15,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:15,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:15,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-11-07 15:42:15,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:15,826 INFO L124 PetriNetUnfolderBase]: 15/663 cut-off events. [2024-11-07 15:42:15,827 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-07 15:42:15,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 663 events. 15/663 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1740 event pairs, 7 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 605. Up to 25 conditions per place. [2024-11-07 15:42:15,837 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-11-07 15:42:15,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 836 flow [2024-11-07 15:42:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-07 15:42:15,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-11-07 15:42:15,841 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 812 flow. Second operand 3 states and 1262 transitions. [2024-11-07 15:42:15,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 836 flow [2024-11-07 15:42:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:15,847 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 810 flow [2024-11-07 15:42:15,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-11-07 15:42:15,849 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-07 15:42:15,849 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 810 flow [2024-11-07 15:42:15,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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:42:15,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:15,850 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] [2024-11-07 15:42:15,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:42:15,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:15,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash 479133799, now seen corresponding path program 1 times [2024-11-07 15:42:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740815108] [2024-11-07 15:42:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:15,901 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:42:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740815108] [2024-11-07 15:42:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740815108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:15,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:15,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811905778] [2024-11-07 15:42:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:15,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:15,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:15,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:15,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 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:42:15,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:15,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:15,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:16,051 INFO L124 PetriNetUnfolderBase]: 21/852 cut-off events. [2024-11-07 15:42:16,051 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-07 15:42:16,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 852 events. 21/852 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3574 event pairs, 6 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 798. Up to 31 conditions per place. [2024-11-07 15:42:16,065 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:16,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 846 flow [2024-11-07 15:42:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:16,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:16,069 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 810 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:16,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 846 flow [2024-11-07 15:42:16,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:16,076 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 816 flow [2024-11-07 15:42:16,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2024-11-07 15:42:16,077 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-07 15:42:16,077 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 816 flow [2024-11-07 15:42:16,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 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:42:16,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:16,078 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] [2024-11-07 15:42:16,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:42:16,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 886112137, now seen corresponding path program 1 times [2024-11-07 15:42:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499910183] [2024-11-07 15:42:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:16,153 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:42:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499910183] [2024-11-07 15:42:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499910183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:16,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324057497] [2024-11-07 15:42:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:16,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:16,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 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:42:16,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:16,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:16,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:16,323 INFO L124 PetriNetUnfolderBase]: 24/1006 cut-off events. [2024-11-07 15:42:16,323 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:42:16,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1006 events. 24/1006 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4949 event pairs, 6 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 857. Up to 33 conditions per place. [2024-11-07 15:42:16,339 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:16,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 402 transitions, 852 flow [2024-11-07 15:42:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:16,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:16,343 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 816 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:16,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 402 transitions, 852 flow [2024-11-07 15:42:16,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:16,349 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2024-11-07 15:42:16,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-11-07 15:42:16,350 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-07 15:42:16,350 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2024-11-07 15:42:16,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 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:42:16,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:16,354 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] [2024-11-07 15:42:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:42:16,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1509085817, now seen corresponding path program 1 times [2024-11-07 15:42:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:16,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170570101] [2024-11-07 15:42:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:16,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:16,423 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:42:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170570101] [2024-11-07 15:42:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170570101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432417386] [2024-11-07 15:42:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:16,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:16,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:16,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:16,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:16,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:16,677 INFO L124 PetriNetUnfolderBase]: 44/1634 cut-off events. [2024-11-07 15:42:16,678 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-07 15:42:16,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1634 events. 44/1634 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10892 event pairs, 11 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2024-11-07 15:42:16,701 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:16,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 862 flow [2024-11-07 15:42:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:16,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:16,704 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:16,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 862 flow [2024-11-07 15:42:16,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:16,710 INFO L231 Difference]: Finished difference. Result has 403 places, 400 transitions, 836 flow [2024-11-07 15:42:16,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=403, PETRI_TRANSITIONS=400} [2024-11-07 15:42:16,713 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-07 15:42:16,713 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 400 transitions, 836 flow [2024-11-07 15:42:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:16,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:16,715 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] [2024-11-07 15:42:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:42:16,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440933, now seen corresponding path program 1 times [2024-11-07 15:42:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343200483] [2024-11-07 15:42:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:16,762 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:42:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343200483] [2024-11-07 15:42:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343200483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997365735] [2024-11-07 15:42:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:16,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:16,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 400 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:16,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:16,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:16,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:16,977 INFO L124 PetriNetUnfolderBase]: 42/1269 cut-off events. [2024-11-07 15:42:16,977 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-07 15:42:16,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1269 events. 42/1269 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7597 event pairs, 5 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1159. Up to 50 conditions per place. [2024-11-07 15:42:16,995 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:16,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 872 flow [2024-11-07 15:42:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:16,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:16,999 INFO L175 Difference]: Start difference. First operand has 403 places, 400 transitions, 836 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:16,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 872 flow [2024-11-07 15:42:17,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 402 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:17,005 INFO L231 Difference]: Finished difference. Result has 404 places, 400 transitions, 846 flow [2024-11-07 15:42:17,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=404, PETRI_TRANSITIONS=400} [2024-11-07 15:42:17,008 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-07 15:42:17,008 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 400 transitions, 846 flow [2024-11-07 15:42:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:17,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:17,010 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] [2024-11-07 15:42:17,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:42:17,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 651751019, now seen corresponding path program 1 times [2024-11-07 15:42:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82171474] [2024-11-07 15:42:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:17,078 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:42:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82171474] [2024-11-07 15:42:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82171474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606231978] [2024-11-07 15:42:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:17,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:17,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 400 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:17,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:17,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:17,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:17,376 INFO L124 PetriNetUnfolderBase]: 61/1652 cut-off events. [2024-11-07 15:42:17,376 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2024-11-07 15:42:17,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1652 events. 61/1652 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9967 event pairs, 18 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1523. Up to 70 conditions per place. [2024-11-07 15:42:17,398 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:17,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 882 flow [2024-11-07 15:42:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:17,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:17,403 INFO L175 Difference]: Start difference. First operand has 404 places, 400 transitions, 846 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:17,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 882 flow [2024-11-07 15:42:17,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:17,411 INFO L231 Difference]: Finished difference. Result has 405 places, 400 transitions, 856 flow [2024-11-07 15:42:17,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2024-11-07 15:42:17,414 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-07 15:42:17,414 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 856 flow [2024-11-07 15:42:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:17,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:17,415 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] [2024-11-07 15:42:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:42:17,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -732459891, now seen corresponding path program 1 times [2024-11-07 15:42:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509463672] [2024-11-07 15:42:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:17,469 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:42:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509463672] [2024-11-07 15:42:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509463672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940496087] [2024-11-07 15:42:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:17,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:17,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:17,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-11-07 15:42:17,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:17,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:17,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-11-07 15:42:17,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:17,746 INFO L124 PetriNetUnfolderBase]: 70/1820 cut-off events. [2024-11-07 15:42:17,746 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2024-11-07 15:42:17,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1820 events. 70/1820 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11195 event pairs, 10 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 1718. Up to 80 conditions per place. [2024-11-07 15:42:17,765 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-07 15:42:17,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 402 transitions, 892 flow [2024-11-07 15:42:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:17,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:17,768 INFO L175 Difference]: Start difference. First operand has 405 places, 400 transitions, 856 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:17,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 402 transitions, 892 flow [2024-11-07 15:42:17,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 402 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:17,774 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 866 flow [2024-11-07 15:42:17,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2024-11-07 15:42:17,775 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-11-07 15:42:17,775 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 866 flow [2024-11-07 15:42:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 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:42:17,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:17,776 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] [2024-11-07 15:42:17,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:42:17,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:17,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 212449739, now seen corresponding path program 1 times [2024-11-07 15:42:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444289220] [2024-11-07 15:42:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:17,843 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:42:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444289220] [2024-11-07 15:42:17,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444289220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:17,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:17,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732637571] [2024-11-07 15:42:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:17,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:17,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-07 15:42:17,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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:42:17,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:17,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-07 15:42:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:18,140 INFO L124 PetriNetUnfolderBase]: 178/1862 cut-off events. [2024-11-07 15:42:18,141 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-07 15:42:18,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1862 events. 178/1862 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13026 event pairs, 84 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 1917. Up to 293 conditions per place. [2024-11-07 15:42:18,157 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-11-07 15:42:18,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 906 flow [2024-11-07 15:42:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-07 15:42:18,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-07 15:42:18,161 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 866 flow. Second operand 3 states and 1259 transitions. [2024-11-07 15:42:18,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 906 flow [2024-11-07 15:42:18,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 400 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:18,167 INFO L231 Difference]: Finished difference. Result has 405 places, 398 transitions, 872 flow [2024-11-07 15:42:18,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2024-11-07 15:42:18,168 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-07 15:42:18,169 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 872 flow [2024-11-07 15:42:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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:42:18,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:18,169 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] [2024-11-07 15:42:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:42:18,170 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1994196883, now seen corresponding path program 1 times [2024-11-07 15:42:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193420633] [2024-11-07 15:42:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:18,234 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:42:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193420633] [2024-11-07 15:42:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193420633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:18,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172739509] [2024-11-07 15:42:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:18,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:18,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-07 15:42:18,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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:42:18,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:18,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-07 15:42:18,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:18,498 INFO L124 PetriNetUnfolderBase]: 123/1527 cut-off events. [2024-11-07 15:42:18,499 INFO L125 PetriNetUnfolderBase]: For 12/42 co-relation queries the response was YES. [2024-11-07 15:42:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1527 events. 123/1527 cut-off events. For 12/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9568 event pairs, 28 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 1543. Up to 152 conditions per place. [2024-11-07 15:42:18,513 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2024-11-07 15:42:18,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 398 transitions, 912 flow [2024-11-07 15:42:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-07 15:42:18,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-07 15:42:18,517 INFO L175 Difference]: Start difference. First operand has 405 places, 398 transitions, 872 flow. Second operand 3 states and 1259 transitions. [2024-11-07 15:42:18,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 398 transitions, 912 flow [2024-11-07 15:42:18,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 398 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:18,522 INFO L231 Difference]: Finished difference. Result has 404 places, 396 transitions, 878 flow [2024-11-07 15:42:18,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2024-11-07 15:42:18,523 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-11-07 15:42:18,523 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 878 flow [2024-11-07 15:42:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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:42:18,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:18,525 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] [2024-11-07 15:42:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:42:18,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1779658794, now seen corresponding path program 1 times [2024-11-07 15:42:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818958726] [2024-11-07 15:42:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:18,586 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:42:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818958726] [2024-11-07 15:42:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818958726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366053832] [2024-11-07 15:42:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:18,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-07 15:42:18,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 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:42:18,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:18,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-07 15:42:18,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:18,813 INFO L124 PetriNetUnfolderBase]: 60/1524 cut-off events. [2024-11-07 15:42:18,814 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2024-11-07 15:42:18,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1524 events. 60/1524 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8498 event pairs, 8 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 1416. Up to 38 conditions per place. [2024-11-07 15:42:18,835 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-07 15:42:18,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 397 transitions, 908 flow [2024-11-07 15:42:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:18,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:18,838 INFO L175 Difference]: Start difference. First operand has 404 places, 396 transitions, 878 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:18,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 397 transitions, 908 flow [2024-11-07 15:42:18,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 397 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:18,866 INFO L231 Difference]: Finished difference. Result has 405 places, 395 transitions, 880 flow [2024-11-07 15:42:18,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=405, PETRI_TRANSITIONS=395} [2024-11-07 15:42:18,867 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-11-07 15:42:18,868 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 880 flow [2024-11-07 15:42:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 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:42:18,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:18,868 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] [2024-11-07 15:42:18,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:42:18,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 651125951, now seen corresponding path program 1 times [2024-11-07 15:42:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013926969] [2024-11-07 15:42:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:18,925 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:42:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:18,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013926969] [2024-11-07 15:42:18,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013926969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955933431] [2024-11-07 15:42:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:18,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-11-07 15:42:18,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:18,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:18,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-11-07 15:42:18,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:19,348 INFO L124 PetriNetUnfolderBase]: 222/1927 cut-off events. [2024-11-07 15:42:19,349 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2024-11-07 15:42:19,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1927 events. 222/1927 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12369 event pairs, 76 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 2166. Up to 346 conditions per place. [2024-11-07 15:42:19,379 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-11-07 15:42:19,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 395 transitions, 920 flow [2024-11-07 15:42:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-07 15:42:19,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-11-07 15:42:19,382 INFO L175 Difference]: Start difference. First operand has 405 places, 395 transitions, 880 flow. Second operand 3 states and 1259 transitions. [2024-11-07 15:42:19,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 395 transitions, 920 flow [2024-11-07 15:42:19,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 395 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:19,389 INFO L231 Difference]: Finished difference. Result has 402 places, 393 transitions, 882 flow [2024-11-07 15:42:19,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=393} [2024-11-07 15:42:19,390 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-07 15:42:19,390 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 393 transitions, 882 flow [2024-11-07 15:42:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:19,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:19,391 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] [2024-11-07 15:42:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:42:19,391 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -82359832, now seen corresponding path program 1 times [2024-11-07 15:42:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450228354] [2024-11-07 15:42:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:19,468 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:42:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450228354] [2024-11-07 15:42:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450228354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338572450] [2024-11-07 15:42:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:19,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:19,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-07 15:42:19,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 393 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 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:42:19,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:19,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-07 15:42:19,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:19,728 INFO L124 PetriNetUnfolderBase]: 66/1560 cut-off events. [2024-11-07 15:42:19,728 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2024-11-07 15:42:19,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1560 events. 66/1560 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8750 event pairs, 6 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 1593. Up to 48 conditions per place. [2024-11-07 15:42:19,745 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-11-07 15:42:19,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 912 flow [2024-11-07 15:42:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:19,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:19,749 INFO L175 Difference]: Start difference. First operand has 402 places, 393 transitions, 882 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:19,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 912 flow [2024-11-07 15:42:19,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 394 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:19,755 INFO L231 Difference]: Finished difference. Result has 403 places, 392 transitions, 884 flow [2024-11-07 15:42:19,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=403, PETRI_TRANSITIONS=392} [2024-11-07 15:42:19,756 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-11-07 15:42:19,756 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 392 transitions, 884 flow [2024-11-07 15:42:19,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 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:42:19,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:19,757 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] [2024-11-07 15:42:19,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:42:19,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1144087775, now seen corresponding path program 1 times [2024-11-07 15:42:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358811269] [2024-11-07 15:42:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:19,829 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:42:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358811269] [2024-11-07 15:42:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358811269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772803366] [2024-11-07 15:42:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:19,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:19,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-11-07 15:42:19,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 392 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 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:42:19,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:19,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-11-07 15:42:19,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:20,040 INFO L124 PetriNetUnfolderBase]: 74/1231 cut-off events. [2024-11-07 15:42:20,041 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2024-11-07 15:42:20,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1231 events. 74/1231 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6257 event pairs, 14 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1475. Up to 76 conditions per place. [2024-11-07 15:42:20,060 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-07 15:42:20,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 914 flow [2024-11-07 15:42:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-07 15:42:20,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-11-07 15:42:20,064 INFO L175 Difference]: Start difference. First operand has 403 places, 392 transitions, 884 flow. Second operand 3 states and 1271 transitions. [2024-11-07 15:42:20,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 914 flow [2024-11-07 15:42:20,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 393 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:20,071 INFO L231 Difference]: Finished difference. Result has 402 places, 391 transitions, 882 flow [2024-11-07 15:42:20,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=391} [2024-11-07 15:42:20,072 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-11-07 15:42:20,072 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 391 transitions, 882 flow [2024-11-07 15:42:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 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:42:20,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:20,073 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] [2024-11-07 15:42:20,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:42:20,073 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:20,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -551136353, now seen corresponding path program 1 times [2024-11-07 15:42:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373727188] [2024-11-07 15:42:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:20,176 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:42:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373727188] [2024-11-07 15:42:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373727188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444752525] [2024-11-07 15:42:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:20,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:20,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-07 15:42:20,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 391 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:20,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:20,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-07 15:42:20,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:20,424 INFO L124 PetriNetUnfolderBase]: 60/1538 cut-off events. [2024-11-07 15:42:20,424 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-11-07 15:42:20,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1538 events. 60/1538 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8400 event pairs, 4 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1589. Up to 50 conditions per place. [2024-11-07 15:42:20,447 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2024-11-07 15:42:20,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 390 transitions, 898 flow [2024-11-07 15:42:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-11-07 15:42:20,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-11-07 15:42:20,451 INFO L175 Difference]: Start difference. First operand has 402 places, 391 transitions, 882 flow. Second operand 3 states and 1273 transitions. [2024-11-07 15:42:20,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 390 transitions, 898 flow [2024-11-07 15:42:20,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 390 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:20,458 INFO L231 Difference]: Finished difference. Result has 401 places, 390 transitions, 878 flow [2024-11-07 15:42:20,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=401, PETRI_TRANSITIONS=390} [2024-11-07 15:42:20,459 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-07 15:42:20,460 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 390 transitions, 878 flow [2024-11-07 15:42:20,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:20,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:20,460 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] [2024-11-07 15:42:20,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:42:20,461 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:20,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -592800542, now seen corresponding path program 1 times [2024-11-07 15:42:20,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:20,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132563881] [2024-11-07 15:42:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:20,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:20,557 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:42:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132563881] [2024-11-07 15:42:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132563881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:20,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578438188] [2024-11-07 15:42:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:20,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-07 15:42:20,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 390 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:20,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:20,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-07 15:42:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:20,815 INFO L124 PetriNetUnfolderBase]: 56/1511 cut-off events. [2024-11-07 15:42:20,815 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-11-07 15:42:20,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1511 events. 56/1511 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8189 event pairs, 3 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1698. Up to 48 conditions per place. [2024-11-07 15:42:20,827 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2024-11-07 15:42:20,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 389 transitions, 894 flow [2024-11-07 15:42:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-11-07 15:42:20,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-11-07 15:42:20,831 INFO L175 Difference]: Start difference. First operand has 401 places, 390 transitions, 878 flow. Second operand 3 states and 1273 transitions. [2024-11-07 15:42:20,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 389 transitions, 894 flow [2024-11-07 15:42:20,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 389 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:42:20,836 INFO L231 Difference]: Finished difference. Result has 401 places, 389 transitions, 877 flow [2024-11-07 15:42:20,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2024-11-07 15:42:20,838 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-07 15:42:20,838 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 877 flow [2024-11-07 15:42:20,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:20,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:20,839 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] [2024-11-07 15:42:20,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:42:20,839 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-07 15:42:20,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash -933491653, now seen corresponding path program 1 times [2024-11-07 15:42:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363519438] [2024-11-07 15:42:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:20,931 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:42:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363519438] [2024-11-07 15:42:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363519438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:20,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:20,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609435781] [2024-11-07 15:42:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:20,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:20,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-11-07 15:42:20,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:20,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:20,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-11-07 15:42:20,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:21,099 INFO L124 PetriNetUnfolderBase]: 52/1170 cut-off events. [2024-11-07 15:42:21,099 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-07 15:42:21,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1170 events. 52/1170 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5778 event pairs, 7 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 1358. Up to 42 conditions per place. [2024-11-07 15:42:21,115 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 0 selfloop transitions, 0 changer transitions 388/388 dead transitions. [2024-11-07 15:42:21,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 388 transitions, 891 flow [2024-11-07 15:42:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2024-11-07 15:42:21,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952808988764045 [2024-11-07 15:42:21,118 INFO L175 Difference]: Start difference. First operand has 401 places, 389 transitions, 877 flow. Second operand 3 states and 1272 transitions. [2024-11-07 15:42:21,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 388 transitions, 891 flow [2024-11-07 15:42:21,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 388 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:42:21,123 INFO L231 Difference]: Finished difference. Result has 401 places, 0 transitions, 0 flow [2024-11-07 15:42:21,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=401, PETRI_TRANSITIONS=0} [2024-11-07 15:42:21,124 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-11-07 15:42:21,124 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 0 transitions, 0 flow [2024-11-07 15:42:21,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 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:42:21,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2024-11-07 15:42:21,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2024-11-07 15:42:21,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2024-11-07 15:42:21,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2024-11-07 15:42:21,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2024-11-07 15:42:21,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2024-11-07 15:42:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2024-11-07 15:42:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2024-11-07 15:42:21,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2024-11-07 15:42:21,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2024-11-07 15:42:21,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2024-11-07 15:42:21,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2024-11-07 15:42:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 15:42:21,133 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-07 15:42:21,137 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:42:21,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:42:21,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:42:21 BasicIcfg [2024-11-07 15:42:21,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:42:21,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:42:21,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:42:21,144 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:42:21,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:12" (3/4) ... [2024-11-07 15:42:21,145 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:42:21,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:42:21,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:42:21,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 15:42:21,154 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 15:42:21,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:42:21,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:42:21,156 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:42:21,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:42:21,241 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:42:21,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:42:21,242 INFO L158 Benchmark]: Toolchain (without parser) took 10003.04ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 91.5MB in the beginning and 232.8MB in the end (delta: -141.3MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,242 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:42:21,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.64ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 79.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,243 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:42:21,244 INFO L158 Benchmark]: RCFGBuilder took 743.08ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 47.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,244 INFO L158 Benchmark]: TraceAbstraction took 8803.32ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 47.3MB in the beginning and 241.2MB in the end (delta: -193.9MB). Peak memory consumption was 135.0MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,245 INFO L158 Benchmark]: Witness Printer took 98.29ms. Allocated memory is still 444.6MB. Free memory was 241.2MB in the beginning and 232.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:42:21,246 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.64ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 79.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 75.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 743.08ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 47.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8803.32ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 47.3MB in the beginning and 241.2MB in the end (delta: -193.9MB). Peak memory consumption was 135.0MB. Max. memory is 16.1GB. * Witness Printer took 98.29ms. Allocated memory is still 444.6MB. Free memory was 241.2MB in the beginning and 232.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 701 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 102 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:42:21,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE