./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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-simpl-str-symm.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 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:01,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:01,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:01,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:01,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:01,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:01,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:01,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:01,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:01,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:01,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:01,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:01,511 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:01,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:01,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:01,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:01,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:01,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:01,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:01,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:01,514 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 -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2025-02-08 05:38:01,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:01,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:01,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:01,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:01,837 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:01,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-02-08 05:38:03,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7c2a885/12cc3f5585e74e2db715b5f62bb14884/FLAGf0bf3143f [2025-02-08 05:38:03,415 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:03,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-02-08 05:38:03,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7c2a885/12cc3f5585e74e2db715b5f62bb14884/FLAGf0bf3143f [2025-02-08 05:38:03,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7c2a885/12cc3f5585e74e2db715b5f62bb14884 [2025-02-08 05:38:03,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:03,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:03,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:03,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:03,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:03,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b39f74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03, skipping insertion in model container [2025-02-08 05:38:03,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:03,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:03,652 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:03,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:03,693 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:03,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03 WrapperNode [2025-02-08 05:38:03,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:03,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:03,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:03,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:03,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,734 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-02-08 05:38:03,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:03,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:03,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:03,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:03,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:03,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:03,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:03,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:03,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (1/1) ... [2025-02-08 05:38:03,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:03,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:03,805 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) [2025-02-08 05:38:03,811 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 [2025-02-08 05:38:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:03,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:03,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:03,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:03,835 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:03,920 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:03,922 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:04,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-11: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:38:04,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:38:04,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:04,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:04,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-15: #t~ret1#1 := minus_#res#1; [2025-02-08 05:38:04,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-11: #t~ite6#1 := #t~ret5#1; [2025-02-08 05:38:04,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 05:38:04,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:04,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:04,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-15: #t~ret5#1 := minus_#res#1; [2025-02-08 05:38:04,260 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:04,261 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:04,282 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:04,282 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:04,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:04 BoogieIcfgContainer [2025-02-08 05:38:04,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:04,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:04,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:04,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:04,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:03" (1/3) ... [2025-02-08 05:38:04,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a18cbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:04, skipping insertion in model container [2025-02-08 05:38:04,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:03" (2/3) ... [2025-02-08 05:38:04,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a18cbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:04, skipping insertion in model container [2025-02-08 05:38:04,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:04" (3/3) ... [2025-02-08 05:38:04,294 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2025-02-08 05:38:04,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:04,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-symm.wvr.c that has 3 procedures, 234 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-02-08 05:38:04,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:04,414 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:38:04,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 245 transitions, 504 flow [2025-02-08 05:38:04,567 INFO L124 PetriNetUnfolderBase]: 12/243 cut-off events. [2025-02-08 05:38:04,570 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:04,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 243 events. 12/243 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2025-02-08 05:38:04,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 245 transitions, 504 flow [2025-02-08 05:38:04,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 223 transitions, 458 flow [2025-02-08 05:38:04,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:04,615 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;@45d6c3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:04,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 05:38:04,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:04,625 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:38:04,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:04,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,627 INFO L206 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] [2025-02-08 05:38:04,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1599182630, now seen corresponding path program 1 times [2025-02-08 05:38:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243901346] [2025-02-08 05:38:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:38:04,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:38:04,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243901346] [2025-02-08 05:38:04,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243901346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480003737] [2025-02-08 05:38:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:04,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:04,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:04,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 223 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:04,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:04,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,006 INFO L124 PetriNetUnfolderBase]: 12/382 cut-off events. [2025-02-08 05:38:05,007 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:38:05,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 382 events. 12/382 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1488 event pairs, 5 based on Foata normal form. 13/330 useless extension candidates. Maximal degree in co-relation 292. Up to 21 conditions per place. [2025-02-08 05:38:05,016 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 10 selfloop transitions, 2 changer transitions 2/216 dead transitions. [2025-02-08 05:38:05,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 468 flow [2025-02-08 05:38:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-08 05:38:05,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9360544217687075 [2025-02-08 05:38:05,043 INFO L175 Difference]: Start difference. First operand has 220 places, 223 transitions, 458 flow. Second operand 3 states and 688 transitions. [2025-02-08 05:38:05,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 468 flow [2025-02-08 05:38:05,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 460 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:05,057 INFO L231 Difference]: Finished difference. Result has 217 places, 214 transitions, 436 flow [2025-02-08 05:38:05,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=217, PETRI_TRANSITIONS=214} [2025-02-08 05:38:05,063 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -3 predicate places. [2025-02-08 05:38:05,063 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 214 transitions, 436 flow [2025-02-08 05:38:05,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,064 INFO L206 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] [2025-02-08 05:38:05,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:05,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1185120094, now seen corresponding path program 1 times [2025-02-08 05:38:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19811541] [2025-02-08 05:38:05,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:38:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:38:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19811541] [2025-02-08 05:38:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19811541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328643378] [2025-02-08 05:38:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 245 [2025-02-08 05:38:05,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 214 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 245 [2025-02-08 05:38:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,205 INFO L124 PetriNetUnfolderBase]: 8/296 cut-off events. [2025-02-08 05:38:05,206 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:05,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 296 events. 8/296 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 846 event pairs, 3 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 291. Up to 16 conditions per place. [2025-02-08 05:38:05,210 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 9 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2025-02-08 05:38:05,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 213 transitions, 456 flow [2025-02-08 05:38:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2025-02-08 05:38:05,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9306122448979591 [2025-02-08 05:38:05,214 INFO L175 Difference]: Start difference. First operand has 217 places, 214 transitions, 436 flow. Second operand 3 states and 684 transitions. [2025-02-08 05:38:05,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 213 transitions, 456 flow [2025-02-08 05:38:05,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 213 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:05,222 INFO L231 Difference]: Finished difference. Result has 214 places, 213 transitions, 434 flow [2025-02-08 05:38:05,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=214, PETRI_TRANSITIONS=213} [2025-02-08 05:38:05,223 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -6 predicate places. [2025-02-08 05:38:05,223 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 213 transitions, 434 flow [2025-02-08 05:38:05,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,225 INFO L206 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] [2025-02-08 05:38:05,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:05,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2034523098, now seen corresponding path program 1 times [2025-02-08 05:38:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704591433] [2025-02-08 05:38:05,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:38:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:38:05,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704591433] [2025-02-08 05:38:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704591433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101854462] [2025-02-08 05:38:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:05,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 213 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,358 INFO L124 PetriNetUnfolderBase]: 11/314 cut-off events. [2025-02-08 05:38:05,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:05,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 314 events. 11/314 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1058 event pairs, 5 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 307. Up to 21 conditions per place. [2025-02-08 05:38:05,363 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 10 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-08 05:38:05,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 212 transitions, 456 flow [2025-02-08 05:38:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-02-08 05:38:05,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927891156462585 [2025-02-08 05:38:05,368 INFO L175 Difference]: Start difference. First operand has 214 places, 213 transitions, 434 flow. Second operand 3 states and 682 transitions. [2025-02-08 05:38:05,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 212 transitions, 456 flow [2025-02-08 05:38:05,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 212 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:05,375 INFO L231 Difference]: Finished difference. Result has 213 places, 212 transitions, 432 flow [2025-02-08 05:38:05,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=213, PETRI_TRANSITIONS=212} [2025-02-08 05:38:05,377 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -7 predicate places. [2025-02-08 05:38:05,377 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 212 transitions, 432 flow [2025-02-08 05:38:05,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,378 INFO L206 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] [2025-02-08 05:38:05,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:05,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2099671484, now seen corresponding path program 1 times [2025-02-08 05:38:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756835160] [2025-02-08 05:38:05,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:38:05,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:38:05,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756835160] [2025-02-08 05:38:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756835160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027262] [2025-02-08 05:38:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 245 [2025-02-08 05:38:05,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 212 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 245 [2025-02-08 05:38:05,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,537 INFO L124 PetriNetUnfolderBase]: 8/297 cut-off events. [2025-02-08 05:38:05,538 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:05,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 297 events. 8/297 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 844 event pairs, 3 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 276. Up to 16 conditions per place. [2025-02-08 05:38:05,540 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 9 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-02-08 05:38:05,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 452 flow [2025-02-08 05:38:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2025-02-08 05:38:05,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9306122448979591 [2025-02-08 05:38:05,547 INFO L175 Difference]: Start difference. First operand has 213 places, 212 transitions, 432 flow. Second operand 3 states and 684 transitions. [2025-02-08 05:38:05,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 452 flow [2025-02-08 05:38:05,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:05,552 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 430 flow [2025-02-08 05:38:05,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2025-02-08 05:38:05,553 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -8 predicate places. [2025-02-08 05:38:05,554 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 430 flow [2025-02-08 05:38:05,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,555 INFO L206 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] [2025-02-08 05:38:05,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:05,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -817080096, now seen corresponding path program 1 times [2025-02-08 05:38:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825881776] [2025-02-08 05:38:05,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:05,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825881776] [2025-02-08 05:38:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825881776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384056425] [2025-02-08 05:38:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:05,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:05,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,738 INFO L124 PetriNetUnfolderBase]: 24/512 cut-off events. [2025-02-08 05:38:05,739 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:05,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 512 events. 24/512 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2431 event pairs, 8 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 506. Up to 36 conditions per place. [2025-02-08 05:38:05,743 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 12 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-02-08 05:38:05,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 212 transitions, 463 flow [2025-02-08 05:38:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-02-08 05:38:05,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346938775510204 [2025-02-08 05:38:05,748 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 430 flow. Second operand 3 states and 687 transitions. [2025-02-08 05:38:05,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 212 transitions, 463 flow [2025-02-08 05:38:05,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 212 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:05,754 INFO L231 Difference]: Finished difference. Result has 210 places, 211 transitions, 441 flow [2025-02-08 05:38:05,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=211} [2025-02-08 05:38:05,756 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -10 predicate places. [2025-02-08 05:38:05,758 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 211 transitions, 441 flow [2025-02-08 05:38:05,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,758 INFO L206 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] [2025-02-08 05:38:05,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:05,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2053003748, now seen corresponding path program 1 times [2025-02-08 05:38:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980436312] [2025-02-08 05:38:05,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:38:05,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:38:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980436312] [2025-02-08 05:38:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980436312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473506709] [2025-02-08 05:38:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:05,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 211 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:05,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:05,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,904 INFO L124 PetriNetUnfolderBase]: 27/563 cut-off events. [2025-02-08 05:38:05,905 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 563 events. 27/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2920 event pairs, 6 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 515. Up to 36 conditions per place. [2025-02-08 05:38:05,910 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 12 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-02-08 05:38:05,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 212 transitions, 474 flow [2025-02-08 05:38:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-02-08 05:38:05,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346938775510204 [2025-02-08 05:38:05,912 INFO L175 Difference]: Start difference. First operand has 210 places, 211 transitions, 441 flow. Second operand 3 states and 687 transitions. [2025-02-08 05:38:05,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 212 transitions, 474 flow [2025-02-08 05:38:05,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 212 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:05,917 INFO L231 Difference]: Finished difference. Result has 210 places, 211 transitions, 456 flow [2025-02-08 05:38:05,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=210, PETRI_TRANSITIONS=211} [2025-02-08 05:38:05,919 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -10 predicate places. [2025-02-08 05:38:05,920 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 211 transitions, 456 flow [2025-02-08 05:38:05,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:05,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:05,920 INFO L206 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] [2025-02-08 05:38:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:05,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -699882903, now seen corresponding path program 1 times [2025-02-08 05:38:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915002941] [2025-02-08 05:38:05,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:05,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:05,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:05,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:05,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915002941] [2025-02-08 05:38:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915002941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264504293] [2025-02-08 05:38:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:05,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:05,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:05,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:05,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 245 [2025-02-08 05:38:06,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 211 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 245 [2025-02-08 05:38:06,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,058 INFO L124 PetriNetUnfolderBase]: 19/472 cut-off events. [2025-02-08 05:38:06,058 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:06,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 472 events. 19/472 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2175 event pairs, 2 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 417. Up to 26 conditions per place. [2025-02-08 05:38:06,061 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 10 selfloop transitions, 2 changer transitions 1/213 dead transitions. [2025-02-08 05:38:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 213 transitions, 488 flow [2025-02-08 05:38:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-02-08 05:38:06,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2025-02-08 05:38:06,064 INFO L175 Difference]: Start difference. First operand has 210 places, 211 transitions, 456 flow. Second operand 3 states and 693 transitions. [2025-02-08 05:38:06,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 213 transitions, 488 flow [2025-02-08 05:38:06,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 213 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:06,068 INFO L231 Difference]: Finished difference. Result has 211 places, 211 transitions, 466 flow [2025-02-08 05:38:06,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2025-02-08 05:38:06,069 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -9 predicate places. [2025-02-08 05:38:06,069 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 466 flow [2025-02-08 05:38:06,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,071 INFO L206 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] [2025-02-08 05:38:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:06,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1722411404, now seen corresponding path program 1 times [2025-02-08 05:38:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291014781] [2025-02-08 05:38:06,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:38:06,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:38:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291014781] [2025-02-08 05:38:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291014781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524933333] [2025-02-08 05:38:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 245 [2025-02-08 05:38:06,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 245 [2025-02-08 05:38:06,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,213 INFO L124 PetriNetUnfolderBase]: 20/490 cut-off events. [2025-02-08 05:38:06,214 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:06,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 490 events. 20/490 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2323 event pairs, 2 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 450. Up to 26 conditions per place. [2025-02-08 05:38:06,216 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 8 selfloop transitions, 2 changer transitions 5/213 dead transitions. [2025-02-08 05:38:06,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 213 transitions, 498 flow [2025-02-08 05:38:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-02-08 05:38:06,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2025-02-08 05:38:06,219 INFO L175 Difference]: Start difference. First operand has 211 places, 211 transitions, 466 flow. Second operand 3 states and 693 transitions. [2025-02-08 05:38:06,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 213 transitions, 498 flow [2025-02-08 05:38:06,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 498 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:06,222 INFO L231 Difference]: Finished difference. Result has 211 places, 207 transitions, 458 flow [2025-02-08 05:38:06,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=211, PETRI_TRANSITIONS=207} [2025-02-08 05:38:06,223 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -9 predicate places. [2025-02-08 05:38:06,223 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 207 transitions, 458 flow [2025-02-08 05:38:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,224 INFO L206 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] [2025-02-08 05:38:06,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:06,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -967069493, now seen corresponding path program 1 times [2025-02-08 05:38:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957346214] [2025-02-08 05:38:06,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:38:06,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:38:06,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957346214] [2025-02-08 05:38:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957346214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982048907] [2025-02-08 05:38:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 245 [2025-02-08 05:38:06,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 207 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 245 [2025-02-08 05:38:06,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,339 INFO L124 PetriNetUnfolderBase]: 16/408 cut-off events. [2025-02-08 05:38:06,339 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:38:06,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 408 events. 16/408 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1720 event pairs, 2 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 365. Up to 14 conditions per place. [2025-02-08 05:38:06,341 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 10 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-02-08 05:38:06,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 207 transitions, 483 flow [2025-02-08 05:38:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-08 05:38:06,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9360544217687075 [2025-02-08 05:38:06,344 INFO L175 Difference]: Start difference. First operand has 211 places, 207 transitions, 458 flow. Second operand 3 states and 688 transitions. [2025-02-08 05:38:06,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 207 transitions, 483 flow [2025-02-08 05:38:06,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 207 transitions, 483 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:06,347 INFO L231 Difference]: Finished difference. Result has 212 places, 206 transitions, 460 flow [2025-02-08 05:38:06,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=212, PETRI_TRANSITIONS=206} [2025-02-08 05:38:06,348 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -8 predicate places. [2025-02-08 05:38:06,348 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 206 transitions, 460 flow [2025-02-08 05:38:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,349 INFO L206 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] [2025-02-08 05:38:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:06,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:06,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1501157149, now seen corresponding path program 1 times [2025-02-08 05:38:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822157195] [2025-02-08 05:38:06,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:06,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822157195] [2025-02-08 05:38:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822157195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976540987] [2025-02-08 05:38:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 245 [2025-02-08 05:38:06,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 206 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 245 [2025-02-08 05:38:06,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,488 INFO L124 PetriNetUnfolderBase]: 15/353 cut-off events. [2025-02-08 05:38:06,488 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:38:06,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 353 events. 15/353 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1360 event pairs, 2 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 348. Up to 20 conditions per place. [2025-02-08 05:38:06,490 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 10 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-08 05:38:06,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 485 flow [2025-02-08 05:38:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-08 05:38:06,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9360544217687075 [2025-02-08 05:38:06,493 INFO L175 Difference]: Start difference. First operand has 212 places, 206 transitions, 460 flow. Second operand 3 states and 688 transitions. [2025-02-08 05:38:06,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 485 flow [2025-02-08 05:38:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:06,496 INFO L231 Difference]: Finished difference. Result has 211 places, 205 transitions, 458 flow [2025-02-08 05:38:06,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=211, PETRI_TRANSITIONS=205} [2025-02-08 05:38:06,497 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -9 predicate places. [2025-02-08 05:38:06,497 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 205 transitions, 458 flow [2025-02-08 05:38:06,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,498 INFO L206 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] [2025-02-08 05:38:06,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:06,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:06,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 547918003, now seen corresponding path program 1 times [2025-02-08 05:38:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491804451] [2025-02-08 05:38:06,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:38:06,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:38:06,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491804451] [2025-02-08 05:38:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491804451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234466270] [2025-02-08 05:38:06,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:06,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 205 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:06,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,626 INFO L124 PetriNetUnfolderBase]: 13/389 cut-off events. [2025-02-08 05:38:06,626 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:06,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 389 events. 13/389 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1561 event pairs, 1 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 364. Up to 13 conditions per place. [2025-02-08 05:38:06,629 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 10 selfloop transitions, 1 changer transitions 0/202 dead transitions. [2025-02-08 05:38:06,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 202 transitions, 474 flow [2025-02-08 05:38:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-02-08 05:38:06,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292517006802721 [2025-02-08 05:38:06,631 INFO L175 Difference]: Start difference. First operand has 211 places, 205 transitions, 458 flow. Second operand 3 states and 683 transitions. [2025-02-08 05:38:06,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 202 transitions, 474 flow [2025-02-08 05:38:06,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 202 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:06,635 INFO L231 Difference]: Finished difference. Result has 208 places, 202 transitions, 450 flow [2025-02-08 05:38:06,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=208, PETRI_TRANSITIONS=202} [2025-02-08 05:38:06,636 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -12 predicate places. [2025-02-08 05:38:06,636 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 202 transitions, 450 flow [2025-02-08 05:38:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,636 INFO L206 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] [2025-02-08 05:38:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:06,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:38:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1578295953, now seen corresponding path program 1 times [2025-02-08 05:38:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991520737] [2025-02-08 05:38:06,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:06,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991520737] [2025-02-08 05:38:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991520737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481590731] [2025-02-08 05:38:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2025-02-08 05:38:06,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 202 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2025-02-08 05:38:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,757 INFO L124 PetriNetUnfolderBase]: 13/368 cut-off events. [2025-02-08 05:38:06,758 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:38:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 368 events. 13/368 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1284 event pairs, 1 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 359. Up to 11 conditions per place. [2025-02-08 05:38:06,760 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 0 selfloop transitions, 0 changer transitions 201/201 dead transitions. [2025-02-08 05:38:06,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 201 transitions, 472 flow [2025-02-08 05:38:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2025-02-08 05:38:06,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9306122448979591 [2025-02-08 05:38:06,762 INFO L175 Difference]: Start difference. First operand has 208 places, 202 transitions, 450 flow. Second operand 3 states and 684 transitions. [2025-02-08 05:38:06,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 201 transitions, 472 flow [2025-02-08 05:38:06,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 201 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:06,765 INFO L231 Difference]: Finished difference. Result has 206 places, 0 transitions, 0 flow [2025-02-08 05:38:06,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=206, PETRI_TRANSITIONS=0} [2025-02-08 05:38:06,766 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -14 predicate places. [2025-02-08 05:38:06,766 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 0 transitions, 0 flow [2025-02-08 05:38:06,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-02-08 05:38:06,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-02-08 05:38:06,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-02-08 05:38:06,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-02-08 05:38:06,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-02-08 05:38:06,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:06,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:06,778 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:06,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:06,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:06 BasicIcfg [2025-02-08 05:38:06,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:06,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:06,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:06,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:06,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:04" (3/4) ... [2025-02-08 05:38:06,788 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:06,791 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:06,791 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:06,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:38:06,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:06,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:06,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:06,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:06,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:06,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:06,897 INFO L158 Benchmark]: Toolchain (without parser) took 3456.68ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 107.9MB in the end (delta: 5.8MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,897 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:06,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:06,899 INFO L158 Benchmark]: Boogie Preprocessor took 31.19ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,899 INFO L158 Benchmark]: IcfgBuilder took 513.58ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 78.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,899 INFO L158 Benchmark]: TraceAbstraction took 2498.19ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 39.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,899 INFO L158 Benchmark]: Witness Printer took 111.68ms. Allocated memory is still 142.6MB. Free memory was 39.0MB in the beginning and 107.9MB in the end (delta: -68.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:06,901 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.34ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.19ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 513.58ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 78.7MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2498.19ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 39.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 111.68ms. Allocated memory is still 142.6MB. Free memory was 39.0MB in the beginning and 107.9MB in the end (delta: -68.9MB). 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: 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: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 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: 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: 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: 71]: 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 5 procedures, 344 locations, 36 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: 2.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 47 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=7, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:06,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE