./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-subst.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-file-item-subst.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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:32,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:32,315 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:37:32,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:32,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:32,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:32,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:32,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:32,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:32,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:32,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:32,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:32,345 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:32,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:32,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:32,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:32,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:32,347 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:32,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:32,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:32,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:32,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:32,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:32,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:32,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:32,351 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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2025-02-08 05:37:32,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:32,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:32,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:32,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:32,662 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:32,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-02-08 05:37:33,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a0cc0ba3/24a49eec510342439745a74d00b02554/FLAG20ab34ff2 [2025-02-08 05:37:34,264 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:34,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-02-08 05:37:34,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a0cc0ba3/24a49eec510342439745a74d00b02554/FLAG20ab34ff2 [2025-02-08 05:37:34,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a0cc0ba3/24a49eec510342439745a74d00b02554 [2025-02-08 05:37:34,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:34,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:34,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:34,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:34,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:34,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f655f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34, skipping insertion in model container [2025-02-08 05:37:34,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:34,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:34,570 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:34,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:34,624 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:34,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34 WrapperNode [2025-02-08 05:37:34,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:34,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:34,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:34,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:34,633 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:37:34" (1/1) ... [2025-02-08 05:37:34,643 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:37:34" (1/1) ... [2025-02-08 05:37:34,682 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2025-02-08 05:37:34,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:34,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:34,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:34,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:34,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:34,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:34,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:34,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:34,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (1/1) ... [2025-02-08 05:37:34,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:34,752 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:37:34,760 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:37:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:34,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:34,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:34,783 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:37:34,889 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:34,891 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:35,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-17: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:37:35,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:37:35,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-21: #t~ret1#1 := minus_#res#1; [2025-02-08 05:37:35,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: #t~ite8#1 := #t~ret7#1; [2025-02-08 05:37:35,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:35,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-21: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:35,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-17: #t~ite14#1 := #t~ret13#1; [2025-02-08 05:37:35,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-18: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:37:35,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-19: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:35,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-20: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:35,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-21: #t~ret13#1 := minus_#res#1; [2025-02-08 05:37:35,377 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:35,378 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:35,394 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:35,394 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:35,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35 BoogieIcfgContainer [2025-02-08 05:37:35,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:35,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:35,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:35,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:35,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:34" (1/3) ... [2025-02-08 05:37:35,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b68e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:35, skipping insertion in model container [2025-02-08 05:37:35,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:34" (2/3) ... [2025-02-08 05:37:35,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b68e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:35, skipping insertion in model container [2025-02-08 05:37:35,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35" (3/3) ... [2025-02-08 05:37:35,405 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2025-02-08 05:37:35,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:35,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-subst.wvr.c that has 4 procedures, 380 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-02-08 05:37:35,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:35,536 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:35,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 397 transitions, 815 flow [2025-02-08 05:37:35,748 INFO L124 PetriNetUnfolderBase]: 18/394 cut-off events. [2025-02-08 05:37:35,750 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:35,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 394 events. 18/394 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1034 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2025-02-08 05:37:35,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 389 places, 397 transitions, 815 flow [2025-02-08 05:37:35,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 368 places, 374 transitions, 766 flow [2025-02-08 05:37:35,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:35,796 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;@5415313d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:35,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-02-08 05:37:35,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:35,805 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:37:35,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:35,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,806 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] [2025-02-08 05:37:35,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -533869542, now seen corresponding path program 1 times [2025-02-08 05:37:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395465280] [2025-02-08 05:37:35,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:37:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:37:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,989 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:37:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395465280] [2025-02-08 05:37:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395465280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735676846] [2025-02-08 05:37:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 397 [2025-02-08 05:37:36,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 397 [2025-02-08 05:37:36,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,285 INFO L124 PetriNetUnfolderBase]: 28/681 cut-off events. [2025-02-08 05:37:36,286 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-02-08 05:37:36,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 681 events. 28/681 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3107 event pairs, 7 based on Foata normal form. 23/582 useless extension candidates. Maximal degree in co-relation 573. Up to 25 conditions per place. [2025-02-08 05:37:36,299 INFO L140 encePairwiseOnDemand]: 387/397 looper letters, 11 selfloop transitions, 2 changer transitions 1/366 dead transitions. [2025-02-08 05:37:36,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 366 transitions, 776 flow [2025-02-08 05:37:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-08 05:37:36,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571788413098237 [2025-02-08 05:37:36,317 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 766 flow. Second operand 3 states and 1140 transitions. [2025-02-08 05:37:36,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 366 transitions, 776 flow [2025-02-08 05:37:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:36,334 INFO L231 Difference]: Finished difference. Result has 363 places, 365 transitions, 740 flow [2025-02-08 05:37:36,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=363, PETRI_TRANSITIONS=365} [2025-02-08 05:37:36,343 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -5 predicate places. [2025-02-08 05:37:36,345 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 365 transitions, 740 flow [2025-02-08 05:37:36,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,346 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] [2025-02-08 05:37:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:36,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 12456162, now seen corresponding path program 1 times [2025-02-08 05:37:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094483705] [2025-02-08 05:37:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:37:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:37:36,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,404 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:37:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094483705] [2025-02-08 05:37:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094483705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346872314] [2025-02-08 05:37:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 397 [2025-02-08 05:37:36,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 365 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 397 [2025-02-08 05:37:36,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,539 INFO L124 PetriNetUnfolderBase]: 20/526 cut-off events. [2025-02-08 05:37:36,539 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 526 events. 20/526 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2078 event pairs, 5 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 522. Up to 22 conditions per place. [2025-02-08 05:37:36,547 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-02-08 05:37:36,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 364 transitions, 764 flow [2025-02-08 05:37:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:36,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513014273719563 [2025-02-08 05:37:36,551 INFO L175 Difference]: Start difference. First operand has 363 places, 365 transitions, 740 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 364 transitions, 764 flow [2025-02-08 05:37:36,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 364 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,557 INFO L231 Difference]: Finished difference. Result has 361 places, 364 transitions, 738 flow [2025-02-08 05:37:36,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=364} [2025-02-08 05:37:36,558 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -7 predicate places. [2025-02-08 05:37:36,559 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 364 transitions, 738 flow [2025-02-08 05:37:36,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,559 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] [2025-02-08 05:37:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:36,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:36,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -357634218, now seen corresponding path program 1 times [2025-02-08 05:37:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143905899] [2025-02-08 05:37:36,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:37:36,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:37:36,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,645 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:37:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143905899] [2025-02-08 05:37:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143905899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504699442] [2025-02-08 05:37:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 397 [2025-02-08 05:37:36,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 364 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 397 [2025-02-08 05:37:36,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,784 INFO L124 PetriNetUnfolderBase]: 19/450 cut-off events. [2025-02-08 05:37:36,784 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 450 events. 19/450 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1590 event pairs, 7 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 440. Up to 25 conditions per place. [2025-02-08 05:37:36,791 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2025-02-08 05:37:36,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 363 transitions, 762 flow [2025-02-08 05:37:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:36,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513014273719563 [2025-02-08 05:37:36,798 INFO L175 Difference]: Start difference. First operand has 361 places, 364 transitions, 738 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:36,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 363 transitions, 762 flow [2025-02-08 05:37:36,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 363 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:36,804 INFO L231 Difference]: Finished difference. Result has 360 places, 363 transitions, 736 flow [2025-02-08 05:37:36,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=363} [2025-02-08 05:37:36,805 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -8 predicate places. [2025-02-08 05:37:36,805 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 363 transitions, 736 flow [2025-02-08 05:37:36,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,807 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] [2025-02-08 05:37:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:36,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -115187897, now seen corresponding path program 1 times [2025-02-08 05:37:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-02-08 05:37:36,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:37:36,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:37:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,865 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:37:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-02-08 05:37:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558502269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778084555] [2025-02-08 05:37:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:36,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 397 [2025-02-08 05:37:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 363 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:36,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 397 [2025-02-08 05:37:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,040 INFO L124 PetriNetUnfolderBase]: 34/801 cut-off events. [2025-02-08 05:37:37,040 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:37,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 801 events. 34/801 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4339 event pairs, 7 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 786. Up to 25 conditions per place. [2025-02-08 05:37:37,054 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 11 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-02-08 05:37:37,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 362 transitions, 760 flow [2025-02-08 05:37:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:37,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513014273719563 [2025-02-08 05:37:37,059 INFO L175 Difference]: Start difference. First operand has 360 places, 363 transitions, 736 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:37,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 362 transitions, 760 flow [2025-02-08 05:37:37,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 362 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,067 INFO L231 Difference]: Finished difference. Result has 359 places, 362 transitions, 734 flow [2025-02-08 05:37:37,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=362} [2025-02-08 05:37:37,068 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -9 predicate places. [2025-02-08 05:37:37,069 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 362 transitions, 734 flow [2025-02-08 05:37:37,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:37,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,070 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:37:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:37,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:37,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1573756598, now seen corresponding path program 1 times [2025-02-08 05:37:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369635211] [2025-02-08 05:37:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:37:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:37:37,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,168 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:37:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369635211] [2025-02-08 05:37:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369635211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288117865] [2025-02-08 05:37:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 397 [2025-02-08 05:37:37,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 362 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:37,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 397 [2025-02-08 05:37:37,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,319 INFO L124 PetriNetUnfolderBase]: 26/572 cut-off events. [2025-02-08 05:37:37,320 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:37,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 572 events. 26/572 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2635 event pairs, 8 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 553. Up to 29 conditions per place. [2025-02-08 05:37:37,331 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 12 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-02-08 05:37:37,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 361 transitions, 760 flow [2025-02-08 05:37:37,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:37,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496221662468514 [2025-02-08 05:37:37,337 INFO L175 Difference]: Start difference. First operand has 359 places, 362 transitions, 734 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:37,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 361 transitions, 760 flow [2025-02-08 05:37:37,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 361 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,346 INFO L231 Difference]: Finished difference. Result has 358 places, 361 transitions, 732 flow [2025-02-08 05:37:37,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=361} [2025-02-08 05:37:37,348 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -10 predicate places. [2025-02-08 05:37:37,348 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 361 transitions, 732 flow [2025-02-08 05:37:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:37,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,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:37:37,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:37,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1144627611, now seen corresponding path program 1 times [2025-02-08 05:37:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931541909] [2025-02-08 05:37:37,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:37:37,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:37:37,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,431 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:37:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931541909] [2025-02-08 05:37:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931541909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698720327] [2025-02-08 05:37:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 397 [2025-02-08 05:37:37,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 361 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:37:37,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 397 [2025-02-08 05:37:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,636 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events. [2025-02-08 05:37:37,636 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:37:37,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 916 events. 53/916 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4903 event pairs, 20 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 908. Up to 50 conditions per place. [2025-02-08 05:37:37,651 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 13 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-02-08 05:37:37,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 360 transitions, 760 flow [2025-02-08 05:37:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-02-08 05:37:37,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479429051217464 [2025-02-08 05:37:37,656 INFO L175 Difference]: Start difference. First operand has 358 places, 361 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2025-02-08 05:37:37,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 360 transitions, 760 flow [2025-02-08 05:37:37,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 360 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,664 INFO L231 Difference]: Finished difference. Result has 357 places, 360 transitions, 730 flow [2025-02-08 05:37:37,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=360} [2025-02-08 05:37:37,665 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -11 predicate places. [2025-02-08 05:37:37,665 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 360 transitions, 730 flow [2025-02-08 05:37:37,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:37:37,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,666 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] [2025-02-08 05:37:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:37,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:37,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1571077366, now seen corresponding path program 1 times [2025-02-08 05:37:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-02-08 05:37:37,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:37:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:37:37,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,736 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:37:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-02-08 05:37:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461821981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715478259] [2025-02-08 05:37:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:37,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 397 [2025-02-08 05:37:37,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 360 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:37,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 397 [2025-02-08 05:37:37,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,878 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2025-02-08 05:37:37,878 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:37,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 674 events. 28/674 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3349 event pairs, 7 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 635. Up to 25 conditions per place. [2025-02-08 05:37:37,890 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 11 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-08 05:37:37,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 754 flow [2025-02-08 05:37:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:37,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513014273719563 [2025-02-08 05:37:37,893 INFO L175 Difference]: Start difference. First operand has 357 places, 360 transitions, 730 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:37,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 754 flow [2025-02-08 05:37:37,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,900 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 728 flow [2025-02-08 05:37:37,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=359} [2025-02-08 05:37:37,901 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -12 predicate places. [2025-02-08 05:37:37,901 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 728 flow [2025-02-08 05:37:37,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:37:37,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,902 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] [2025-02-08 05:37:37,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:37,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:37,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -728903611, now seen corresponding path program 1 times [2025-02-08 05:37:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-02-08 05:37:37,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:37:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:37:37,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,990 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:37:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-02-08 05:37:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9810766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425023137] [2025-02-08 05:37:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:37,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 397 [2025-02-08 05:37:38,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:38,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 397 [2025-02-08 05:37:38,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,119 INFO L124 PetriNetUnfolderBase]: 29/678 cut-off events. [2025-02-08 05:37:38,119 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:38,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 678 events. 29/678 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3533 event pairs, 8 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 635. Up to 29 conditions per place. [2025-02-08 05:37:38,129 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 12 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-02-08 05:37:38,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 754 flow [2025-02-08 05:37:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:38,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496221662468514 [2025-02-08 05:37:38,132 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 728 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:38,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 754 flow [2025-02-08 05:37:38,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,138 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 726 flow [2025-02-08 05:37:38,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=355, PETRI_TRANSITIONS=358} [2025-02-08 05:37:38,139 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -13 predicate places. [2025-02-08 05:37:38,139 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 726 flow [2025-02-08 05:37:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:38,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,140 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] [2025-02-08 05:37:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:38,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1422162327, now seen corresponding path program 1 times [2025-02-08 05:37:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943453571] [2025-02-08 05:37:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:37:38,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:37:38,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,194 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:37:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943453571] [2025-02-08 05:37:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943453571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189631440] [2025-02-08 05:37:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 397 [2025-02-08 05:37:38,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 358 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:37:38,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 397 [2025-02-08 05:37:38,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,303 INFO L124 PetriNetUnfolderBase]: 35/539 cut-off events. [2025-02-08 05:37:38,304 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-02-08 05:37:38,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 539 events. 35/539 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2516 event pairs, 20 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 507. Up to 50 conditions per place. [2025-02-08 05:37:38,314 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 13 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-02-08 05:37:38,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 754 flow [2025-02-08 05:37:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-02-08 05:37:38,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479429051217464 [2025-02-08 05:37:38,318 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 726 flow. Second operand 3 states and 1129 transitions. [2025-02-08 05:37:38,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 754 flow [2025-02-08 05:37:38,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,324 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 724 flow [2025-02-08 05:37:38,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2025-02-08 05:37:38,325 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -14 predicate places. [2025-02-08 05:37:38,325 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 724 flow [2025-02-08 05:37:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:37:38,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,326 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:37:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:38,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1015223201, now seen corresponding path program 1 times [2025-02-08 05:37:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828185896] [2025-02-08 05:37:38,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:37:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:37:38,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,386 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:37:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828185896] [2025-02-08 05:37:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828185896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950797441] [2025-02-08 05:37:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:38,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:38,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:38,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,536 INFO L124 PetriNetUnfolderBase]: 62/1168 cut-off events. [2025-02-08 05:37:38,536 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:38,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 1168 events. 62/1168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8133 event pairs, 13 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1132. Up to 43 conditions per place. [2025-02-08 05:37:38,551 INFO L140 encePairwiseOnDemand]: 393/397 looper letters, 13 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-08 05:37:38,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 359 transitions, 760 flow [2025-02-08 05:37:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-08 05:37:38,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588581024349286 [2025-02-08 05:37:38,555 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 724 flow. Second operand 3 states and 1142 transitions. [2025-02-08 05:37:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 359 transitions, 760 flow [2025-02-08 05:37:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 359 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,560 INFO L231 Difference]: Finished difference. Result has 353 places, 357 transitions, 730 flow [2025-02-08 05:37:38,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=353, PETRI_TRANSITIONS=357} [2025-02-08 05:37:38,562 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:38,563 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 357 transitions, 730 flow [2025-02-08 05:37:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:38,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,566 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, 1, 1, 1] [2025-02-08 05:37:38,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:38,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:38,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash -644541841, now seen corresponding path program 1 times [2025-02-08 05:37:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-02-08 05:37:38,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:37:38,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:37:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,635 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:37:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-02-08 05:37:38,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022582898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730319272] [2025-02-08 05:37:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 397 [2025-02-08 05:37:38,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 357 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:38,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 397 [2025-02-08 05:37:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,792 INFO L124 PetriNetUnfolderBase]: 57/998 cut-off events. [2025-02-08 05:37:38,792 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:38,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 998 events. 57/998 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6379 event pairs, 10 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 887. Up to 49 conditions per place. [2025-02-08 05:37:38,811 INFO L140 encePairwiseOnDemand]: 391/397 looper letters, 15 selfloop transitions, 3 changer transitions 0/359 dead transitions. [2025-02-08 05:37:38,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 359 transitions, 772 flow [2025-02-08 05:37:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-02-08 05:37:38,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546599496221663 [2025-02-08 05:37:38,815 INFO L175 Difference]: Start difference. First operand has 353 places, 357 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2025-02-08 05:37:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 359 transitions, 772 flow [2025-02-08 05:37:38,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 359 transitions, 772 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:38,820 INFO L231 Difference]: Finished difference. Result has 353 places, 357 transitions, 745 flow [2025-02-08 05:37:38,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=353, PETRI_TRANSITIONS=357} [2025-02-08 05:37:38,821 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:38,821 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 357 transitions, 745 flow [2025-02-08 05:37:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:38,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,822 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, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:38,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:38,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:38,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1253579754, now seen corresponding path program 1 times [2025-02-08 05:37:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336464038] [2025-02-08 05:37:38,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:37:38,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:37:38,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,896 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:37:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336464038] [2025-02-08 05:37:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336464038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194644319] [2025-02-08 05:37:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:38,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,082 INFO L124 PetriNetUnfolderBase]: 54/1216 cut-off events. [2025-02-08 05:37:39,083 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-02-08 05:37:39,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1216 events. 54/1216 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8764 event pairs, 4 based on Foata normal form. 1/1030 useless extension candidates. Maximal degree in co-relation 1047. Up to 53 conditions per place. [2025-02-08 05:37:39,103 INFO L140 encePairwiseOnDemand]: 393/397 looper letters, 16 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-02-08 05:37:39,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 362 transitions, 796 flow [2025-02-08 05:37:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1145 transitions. [2025-02-08 05:37:39,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961376994122586 [2025-02-08 05:37:39,107 INFO L175 Difference]: Start difference. First operand has 353 places, 357 transitions, 745 flow. Second operand 3 states and 1145 transitions. [2025-02-08 05:37:39,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 362 transitions, 796 flow [2025-02-08 05:37:39,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 362 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:39,113 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 755 flow [2025-02-08 05:37:39,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2025-02-08 05:37:39,116 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -14 predicate places. [2025-02-08 05:37:39,116 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 755 flow [2025-02-08 05:37:39,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:39,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,117 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:39,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:39,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:39,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash -590154611, now seen corresponding path program 1 times [2025-02-08 05:37:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874301658] [2025-02-08 05:37:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:39,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,181 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:37:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874301658] [2025-02-08 05:37:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874301658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507025580] [2025-02-08 05:37:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 397 [2025-02-08 05:37:39,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 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:37:39,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 397 [2025-02-08 05:37:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,338 INFO L124 PetriNetUnfolderBase]: 47/1006 cut-off events. [2025-02-08 05:37:39,339 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2025-02-08 05:37:39,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1006 events. 47/1006 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6553 event pairs, 8 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 912. Up to 32 conditions per place. [2025-02-08 05:37:39,353 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 11 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-02-08 05:37:39,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 358 transitions, 785 flow [2025-02-08 05:37:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-08 05:37:39,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588581024349286 [2025-02-08 05:37:39,357 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 755 flow. Second operand 3 states and 1142 transitions. [2025-02-08 05:37:39,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 358 transitions, 785 flow [2025-02-08 05:37:39,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 785 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:39,362 INFO L231 Difference]: Finished difference. Result has 355 places, 356 transitions, 757 flow [2025-02-08 05:37:39,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=355, PETRI_TRANSITIONS=356} [2025-02-08 05:37:39,364 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -13 predicate places. [2025-02-08 05:37:39,364 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 356 transitions, 757 flow [2025-02-08 05:37:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 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:37:39,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:39,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:39,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1658444893, now seen corresponding path program 1 times [2025-02-08 05:37:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092376] [2025-02-08 05:37:39,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:37:39,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:37:39,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,422 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:37:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64092376] [2025-02-08 05:37:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64092376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787691043] [2025-02-08 05:37:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 397 [2025-02-08 05:37:39,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 356 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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:37:39,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 397 [2025-02-08 05:37:39,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,863 INFO L124 PetriNetUnfolderBase]: 295/3663 cut-off events. [2025-02-08 05:37:39,863 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2025-02-08 05:37:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 3663 events. 295/3663 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 38189 event pairs, 96 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 3295. Up to 312 conditions per place. [2025-02-08 05:37:39,891 INFO L140 encePairwiseOnDemand]: 389/397 looper letters, 17 selfloop transitions, 4 changer transitions 0/358 dead transitions. [2025-02-08 05:37:39,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 358 transitions, 805 flow [2025-02-08 05:37:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1132 transitions. [2025-02-08 05:37:39,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504617968094039 [2025-02-08 05:37:39,895 INFO L175 Difference]: Start difference. First operand has 355 places, 356 transitions, 757 flow. Second operand 3 states and 1132 transitions. [2025-02-08 05:37:39,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 358 transitions, 805 flow [2025-02-08 05:37:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 358 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,901 INFO L231 Difference]: Finished difference. Result has 352 places, 356 transitions, 773 flow [2025-02-08 05:37:39,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=352, PETRI_TRANSITIONS=356} [2025-02-08 05:37:39,902 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -16 predicate places. [2025-02-08 05:37:39,902 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 356 transitions, 773 flow [2025-02-08 05:37:39,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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:37:39,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:39,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:39,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 654607226, now seen corresponding path program 1 times [2025-02-08 05:37:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201206911] [2025-02-08 05:37:39,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:37:39,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:37:39,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,953 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:37:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201206911] [2025-02-08 05:37:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201206911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593843329] [2025-02-08 05:37:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 397 [2025-02-08 05:37:39,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 356 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:39,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 397 [2025-02-08 05:37:39,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,336 INFO L124 PetriNetUnfolderBase]: 128/2755 cut-off events. [2025-02-08 05:37:40,336 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2025-02-08 05:37:40,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2755 events. 128/2755 cut-off events. For 23/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26033 event pairs, 20 based on Foata normal form. 1/2345 useless extension candidates. Maximal degree in co-relation 2614. Up to 133 conditions per place. [2025-02-08 05:37:40,363 INFO L140 encePairwiseOnDemand]: 391/397 looper letters, 18 selfloop transitions, 3 changer transitions 0/361 dead transitions. [2025-02-08 05:37:40,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 361 transitions, 830 flow [2025-02-08 05:37:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-08 05:37:40,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571788413098237 [2025-02-08 05:37:40,367 INFO L175 Difference]: Start difference. First operand has 352 places, 356 transitions, 773 flow. Second operand 3 states and 1140 transitions. [2025-02-08 05:37:40,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 361 transitions, 830 flow [2025-02-08 05:37:40,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 361 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,374 INFO L231 Difference]: Finished difference. Result has 352 places, 356 transitions, 788 flow [2025-02-08 05:37:40,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=352, PETRI_TRANSITIONS=356} [2025-02-08 05:37:40,376 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -16 predicate places. [2025-02-08 05:37:40,376 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 356 transitions, 788 flow [2025-02-08 05:37:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:37:40,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:40,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:40,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2041813930, now seen corresponding path program 1 times [2025-02-08 05:37:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295075142] [2025-02-08 05:37:40,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:40,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:40,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,437 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:37:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295075142] [2025-02-08 05:37:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295075142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608484073] [2025-02-08 05:37:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:40,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 356 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:40,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:40,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,744 INFO L124 PetriNetUnfolderBase]: 90/2089 cut-off events. [2025-02-08 05:37:40,744 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-02-08 05:37:40,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 2089 events. 90/2089 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18734 event pairs, 4 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 1888. Up to 56 conditions per place. [2025-02-08 05:37:40,763 INFO L140 encePairwiseOnDemand]: 393/397 looper letters, 14 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-08 05:37:40,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 359 transitions, 829 flow [2025-02-08 05:37:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-08 05:37:40,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596977329974811 [2025-02-08 05:37:40,766 INFO L175 Difference]: Start difference. First operand has 352 places, 356 transitions, 788 flow. Second operand 3 states and 1143 transitions. [2025-02-08 05:37:40,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 359 transitions, 829 flow [2025-02-08 05:37:40,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 359 transitions, 829 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,773 INFO L231 Difference]: Finished difference. Result has 353 places, 356 transitions, 798 flow [2025-02-08 05:37:40,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=353, PETRI_TRANSITIONS=356} [2025-02-08 05:37:40,774 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:40,774 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 356 transitions, 798 flow [2025-02-08 05:37:40,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:40,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:40,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:40,776 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:40,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1418347838, now seen corresponding path program 1 times [2025-02-08 05:37:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703545911] [2025-02-08 05:37:40,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:40,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,838 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:37:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703545911] [2025-02-08 05:37:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703545911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563615483] [2025-02-08 05:37:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:40,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 356 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:37:40,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:40,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,311 INFO L124 PetriNetUnfolderBase]: 131/2762 cut-off events. [2025-02-08 05:37:41,311 INFO L125 PetriNetUnfolderBase]: For 21/42 co-relation queries the response was YES. [2025-02-08 05:37:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 2762 events. 131/2762 cut-off events. For 21/42 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 27367 event pairs, 16 based on Foata normal form. 1/2373 useless extension candidates. Maximal degree in co-relation 2945. Up to 68 conditions per place. [2025-02-08 05:37:41,358 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 12 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-02-08 05:37:41,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 357 transitions, 830 flow [2025-02-08 05:37:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-08 05:37:41,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571788413098237 [2025-02-08 05:37:41,362 INFO L175 Difference]: Start difference. First operand has 353 places, 356 transitions, 798 flow. Second operand 3 states and 1140 transitions. [2025-02-08 05:37:41,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 357 transitions, 830 flow [2025-02-08 05:37:41,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,370 INFO L231 Difference]: Finished difference. Result has 354 places, 355 transitions, 800 flow [2025-02-08 05:37:41,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=354, PETRI_TRANSITIONS=355} [2025-02-08 05:37:41,372 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -14 predicate places. [2025-02-08 05:37:41,372 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 355 transitions, 800 flow [2025-02-08 05:37:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:37:41,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:41,375 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:41,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 616893880, now seen corresponding path program 1 times [2025-02-08 05:37:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042509522] [2025-02-08 05:37:41,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:41,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:41,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,426 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:37:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042509522] [2025-02-08 05:37:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042509522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907963800] [2025-02-08 05:37:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:41,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 355 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:41,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,730 INFO L124 PetriNetUnfolderBase]: 102/2236 cut-off events. [2025-02-08 05:37:41,731 INFO L125 PetriNetUnfolderBase]: For 23/31 co-relation queries the response was YES. [2025-02-08 05:37:41,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 2236 events. 102/2236 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 19621 event pairs, 6 based on Foata normal form. 1/1943 useless extension candidates. Maximal degree in co-relation 2258. Up to 105 conditions per place. [2025-02-08 05:37:41,750 INFO L140 encePairwiseOnDemand]: 393/397 looper letters, 15 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-08 05:37:41,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 359 transitions, 846 flow [2025-02-08 05:37:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-02-08 05:37:41,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9605373635600336 [2025-02-08 05:37:41,754 INFO L175 Difference]: Start difference. First operand has 354 places, 355 transitions, 800 flow. Second operand 3 states and 1144 transitions. [2025-02-08 05:37:41,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 359 transitions, 846 flow [2025-02-08 05:37:41,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 359 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:41,759 INFO L231 Difference]: Finished difference. Result has 353 places, 355 transitions, 806 flow [2025-02-08 05:37:41,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=353, PETRI_TRANSITIONS=355} [2025-02-08 05:37:41,760 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:41,761 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 355 transitions, 806 flow [2025-02-08 05:37:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:37:41,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:41,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 750421040, now seen corresponding path program 1 times [2025-02-08 05:37:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610287386] [2025-02-08 05:37:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:37:41,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:37:41,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,804 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:37:41,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610287386] [2025-02-08 05:37:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610287386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337453879] [2025-02-08 05:37:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 397 [2025-02-08 05:37:41,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 355 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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:37:41,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 397 [2025-02-08 05:37:41,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,436 INFO L124 PetriNetUnfolderBase]: 370/5127 cut-off events. [2025-02-08 05:37:42,436 INFO L125 PetriNetUnfolderBase]: For 82/92 co-relation queries the response was YES. [2025-02-08 05:37:42,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 5127 events. 370/5127 cut-off events. For 82/92 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 58726 event pairs, 64 based on Foata normal form. 2/4554 useless extension candidates. Maximal degree in co-relation 5169. Up to 502 conditions per place. [2025-02-08 05:37:42,469 INFO L140 encePairwiseOnDemand]: 389/397 looper letters, 19 selfloop transitions, 4 changer transitions 0/359 dead transitions. [2025-02-08 05:37:42,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 359 transitions, 864 flow [2025-02-08 05:37:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-02-08 05:37:42,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9521410579345088 [2025-02-08 05:37:42,473 INFO L175 Difference]: Start difference. First operand has 353 places, 355 transitions, 806 flow. Second operand 3 states and 1134 transitions. [2025-02-08 05:37:42,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 359 transitions, 864 flow [2025-02-08 05:37:42,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 359 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:42,479 INFO L231 Difference]: Finished difference. Result has 352 places, 355 transitions, 826 flow [2025-02-08 05:37:42,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=352, PETRI_TRANSITIONS=355} [2025-02-08 05:37:42,480 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -16 predicate places. [2025-02-08 05:37:42,480 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 355 transitions, 826 flow [2025-02-08 05:37:42,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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:37:42,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:42,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:42,481 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1773315696, now seen corresponding path program 1 times [2025-02-08 05:37:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50999708] [2025-02-08 05:37:42,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:42,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,530 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:37:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50999708] [2025-02-08 05:37:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50999708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489283313] [2025-02-08 05:37:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:42,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 355 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 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:37:42,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:42,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([974] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [442#true, 436#(= |#race~is_null_6~0| 0), 189#L80true, Black: 419#true, 425#(= |#race~is_null_3~0| 0), 457#true, 70#L56-7true, Black: 453#true, Black: 423#true, Black: 427#true, 455#(= 0 |#race~filename_is_null_8~0|), 440#(= 0 |#race~filename_is_null_5~0|), Black: 434#true, 449#true, Black: 438#true, 421#(= |#race~is_null_0~0| 0), 429#(= 0 |#race~filename_is_null_2~0|)]) [2025-02-08 05:37:42,880 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-02-08 05:37:42,881 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-08 05:37:42,881 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-08 05:37:42,881 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-08 05:37:42,898 INFO L124 PetriNetUnfolderBase]: 206/2828 cut-off events. [2025-02-08 05:37:42,899 INFO L125 PetriNetUnfolderBase]: For 92/107 co-relation queries the response was YES. [2025-02-08 05:37:42,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2828 events. 206/2828 cut-off events. For 92/107 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28239 event pairs, 38 based on Foata normal form. 1/2553 useless extension candidates. Maximal degree in co-relation 3253. Up to 198 conditions per place. [2025-02-08 05:37:42,937 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 12 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-02-08 05:37:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 356 transitions, 858 flow [2025-02-08 05:37:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-08 05:37:42,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571788413098237 [2025-02-08 05:37:42,940 INFO L175 Difference]: Start difference. First operand has 352 places, 355 transitions, 826 flow. Second operand 3 states and 1140 transitions. [2025-02-08 05:37:42,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 356 transitions, 858 flow [2025-02-08 05:37:42,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 356 transitions, 858 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:42,946 INFO L231 Difference]: Finished difference. Result has 353 places, 354 transitions, 828 flow [2025-02-08 05:37:42,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=353, PETRI_TRANSITIONS=354} [2025-02-08 05:37:42,947 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:42,947 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 354 transitions, 828 flow [2025-02-08 05:37:42,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 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:37:42,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:42,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2074422349, now seen corresponding path program 1 times [2025-02-08 05:37:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211430029] [2025-02-08 05:37:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:42,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,992 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:37:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211430029] [2025-02-08 05:37:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211430029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350507529] [2025-02-08 05:37:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:43,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 354 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:37:43,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:43,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1037] thread3EXIT-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][333], [442#true, 436#(= |#race~is_null_6~0| 0), Black: 419#true, 425#(= |#race~is_null_3~0| 0), 457#true, Black: 453#true, Black: 423#true, Black: 427#true, 295#L82-6true, 460#true, 440#(= 0 |#race~filename_is_null_5~0|), 455#(= 0 |#race~filename_is_null_8~0|), Black: 434#true, 449#true, 421#(= |#race~is_null_0~0| 0), Black: 438#true, 429#(= 0 |#race~filename_is_null_2~0|)]) [2025-02-08 05:37:43,395 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-02-08 05:37:43,395 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-02-08 05:37:43,395 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-02-08 05:37:43,395 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-02-08 05:37:43,400 INFO L124 PetriNetUnfolderBase]: 204/3575 cut-off events. [2025-02-08 05:37:43,401 INFO L125 PetriNetUnfolderBase]: For 41/47 co-relation queries the response was YES. [2025-02-08 05:37:43,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4277 conditions, 3575 events. 204/3575 cut-off events. For 41/47 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 36345 event pairs, 20 based on Foata normal form. 0/3238 useless extension candidates. Maximal degree in co-relation 3658. Up to 244 conditions per place. [2025-02-08 05:37:43,440 INFO L140 encePairwiseOnDemand]: 393/397 looper letters, 13 selfloop transitions, 2 changer transitions 1/357 dead transitions. [2025-02-08 05:37:43,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 357 transitions, 869 flow [2025-02-08 05:37:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-08 05:37:43,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596977329974811 [2025-02-08 05:37:43,443 INFO L175 Difference]: Start difference. First operand has 353 places, 354 transitions, 828 flow. Second operand 3 states and 1143 transitions. [2025-02-08 05:37:43,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 357 transitions, 869 flow [2025-02-08 05:37:43,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 357 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:43,450 INFO L231 Difference]: Finished difference. Result has 352 places, 354 transitions, 834 flow [2025-02-08 05:37:43,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=352, PETRI_TRANSITIONS=354} [2025-02-08 05:37:43,451 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -16 predicate places. [2025-02-08 05:37:43,451 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 354 transitions, 834 flow [2025-02-08 05:37:43,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:37:43,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:43,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -990783093, now seen corresponding path program 1 times [2025-02-08 05:37:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957541572] [2025-02-08 05:37:43,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 05:37:43,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 05:37:43,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,515 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:37:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957541572] [2025-02-08 05:37:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957541572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585015301] [2025-02-08 05:37:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 397 [2025-02-08 05:37:43,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 354 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 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:37:43,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 397 [2025-02-08 05:37:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,971 INFO L124 PetriNetUnfolderBase]: 163/3447 cut-off events. [2025-02-08 05:37:43,971 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-02-08 05:37:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 3447 events. 163/3447 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 35243 event pairs, 4 based on Foata normal form. 0/3152 useless extension candidates. Maximal degree in co-relation 3546. Up to 128 conditions per place. [2025-02-08 05:37:44,002 INFO L140 encePairwiseOnDemand]: 395/397 looper letters, 8 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2025-02-08 05:37:44,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 353 transitions, 850 flow [2025-02-08 05:37:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-02-08 05:37:44,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9605373635600336 [2025-02-08 05:37:44,006 INFO L175 Difference]: Start difference. First operand has 352 places, 354 transitions, 834 flow. Second operand 3 states and 1144 transitions. [2025-02-08 05:37:44,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 353 transitions, 850 flow [2025-02-08 05:37:44,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 353 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:44,012 INFO L231 Difference]: Finished difference. Result has 353 places, 353 transitions, 834 flow [2025-02-08 05:37:44,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=353, PETRI_TRANSITIONS=353} [2025-02-08 05:37:44,013 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -15 predicate places. [2025-02-08 05:37:44,013 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 834 flow [2025-02-08 05:37:44,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 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:37:44,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:44,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:44,014 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:44,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash 426207523, now seen corresponding path program 1 times [2025-02-08 05:37:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:44,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940945564] [2025-02-08 05:37:44,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:44,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 05:37:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 05:37:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:44,077 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:37:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940945564] [2025-02-08 05:37:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940945564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970604617] [2025-02-08 05:37:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:44,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:44,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:44,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:44,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:44,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:44,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:44,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:44,544 INFO L124 PetriNetUnfolderBase]: 162/3546 cut-off events. [2025-02-08 05:37:44,545 INFO L125 PetriNetUnfolderBase]: For 8/23 co-relation queries the response was YES. [2025-02-08 05:37:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 3546 events. 162/3546 cut-off events. For 8/23 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 36946 event pairs, 9 based on Foata normal form. 0/3246 useless extension candidates. Maximal degree in co-relation 4077. Up to 122 conditions per place. [2025-02-08 05:37:44,582 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 10 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2025-02-08 05:37:44,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 852 flow [2025-02-08 05:37:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-02-08 05:37:44,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554995801847187 [2025-02-08 05:37:44,586 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 834 flow. Second operand 3 states and 1138 transitions. [2025-02-08 05:37:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 852 flow [2025-02-08 05:37:44,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 351 transitions, 851 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:44,592 INFO L231 Difference]: Finished difference. Result has 352 places, 351 transitions, 831 flow [2025-02-08 05:37:44,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=352, PETRI_TRANSITIONS=351} [2025-02-08 05:37:44,592 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -16 predicate places. [2025-02-08 05:37:44,593 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 351 transitions, 831 flow [2025-02-08 05:37:44,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:44,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:44,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:44,594 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:44,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash -197750858, now seen corresponding path program 1 times [2025-02-08 05:37:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:44,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576621930] [2025-02-08 05:37:44,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:44,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:37:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:37:44,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:44,646 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:37:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576621930] [2025-02-08 05:37:44,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576621930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:44,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:44,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778051762] [2025-02-08 05:37:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:44,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:44,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:44,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:44,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 397 [2025-02-08 05:37:44,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 351 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:44,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:44,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 397 [2025-02-08 05:37:44,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:44,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [442#true, 436#(= |#race~is_null_6~0| 0), 189#L80true, Black: 419#true, 425#(= |#race~is_null_3~0| 0), 470#true, Black: 453#true, Black: 423#true, 467#true, Black: 427#true, 460#true, 455#(= 0 |#race~filename_is_null_8~0|), 440#(= 0 |#race~filename_is_null_5~0|), 346#L56-5true, Black: 434#true, 449#true, Black: 438#true, 421#(= |#race~is_null_0~0| 0), 429#(= 0 |#race~filename_is_null_2~0|)]) [2025-02-08 05:37:44,966 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-08 05:37:44,966 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:37:44,966 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:37:44,966 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:37:44,979 INFO L124 PetriNetUnfolderBase]: 146/2744 cut-off events. [2025-02-08 05:37:44,980 INFO L125 PetriNetUnfolderBase]: For 21/30 co-relation queries the response was YES. [2025-02-08 05:37:44,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 2744 events. 146/2744 cut-off events. For 21/30 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 26539 event pairs, 19 based on Foata normal form. 5/2513 useless extension candidates. Maximal degree in co-relation 3242. Up to 104 conditions per place. [2025-02-08 05:37:44,994 INFO L140 encePairwiseOnDemand]: 394/397 looper letters, 0 selfloop transitions, 0 changer transitions 349/349 dead transitions. [2025-02-08 05:37:44,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 349 transitions, 847 flow [2025-02-08 05:37:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-02-08 05:37:44,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546599496221663 [2025-02-08 05:37:44,997 INFO L175 Difference]: Start difference. First operand has 352 places, 351 transitions, 831 flow. Second operand 3 states and 1137 transitions. [2025-02-08 05:37:44,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 349 transitions, 847 flow [2025-02-08 05:37:45,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 349 transitions, 846 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:45,002 INFO L231 Difference]: Finished difference. Result has 351 places, 0 transitions, 0 flow [2025-02-08 05:37:45,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=397, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=351, PETRI_TRANSITIONS=0} [2025-02-08 05:37:45,003 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -17 predicate places. [2025-02-08 05:37:45,003 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 0 transitions, 0 flow [2025-02-08 05:37:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:45,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-02-08 05:37:45,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-02-08 05:37:45,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-02-08 05:37:45,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-02-08 05:37:45,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-02-08 05:37:45,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-02-08 05:37:45,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-02-08 05:37:45,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-02-08 05:37:45,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-02-08 05:37:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:45,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:45,018 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:45,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:45,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:45 BasicIcfg [2025-02-08 05:37:45,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:45,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:45,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:45,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:45,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:35" (3/4) ... [2025-02-08 05:37:45,029 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:45,032 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:45,033 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:45,033 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:45,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 05:37:45,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:45,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:45,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:45,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:45,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:45,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:45,124 INFO L158 Benchmark]: Toolchain (without parser) took 10782.26ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 105.7MB in the beginning and 644.4MB in the end (delta: -538.7MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,125 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:45,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.69ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.14ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,126 INFO L158 Benchmark]: Boogie Preprocessor took 28.34ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.6MB in the end (delta: 990.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:45,126 INFO L158 Benchmark]: IcfgBuilder took 679.89ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 62.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,127 INFO L158 Benchmark]: TraceAbstraction took 9628.60ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 61.2MB in the beginning and 652.8MB in the end (delta: -591.6MB). Peak memory consumption was 408.7MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,127 INFO L158 Benchmark]: Witness Printer took 96.86ms. Allocated memory is still 763.4MB. Free memory was 652.8MB in the beginning and 644.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:45,129 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.73ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.69ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.14ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.34ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.6MB in the end (delta: 990.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 679.89ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 62.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9628.60ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 61.2MB in the beginning and 652.8MB in the end (delta: -591.6MB). Peak memory consumption was 408.7MB. Max. memory is 16.1GB. * Witness Printer took 96.86ms. Allocated memory is still 763.4MB. Free memory was 652.8MB in the beginning and 644.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 596 locations, 71 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: 9.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 651 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 104 mSDtfsCounter, 651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=834occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:45,148 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