./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.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/popl20-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:44,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:44,919 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:39:44,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:44,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:44,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:44,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:44,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:44,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:44,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:44,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:44,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:44,937 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:44,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:44,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:44,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:44,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:44,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:44,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:44,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:44,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:44,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:44,940 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-02-08 05:39:45,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:45,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:45,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:45,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:45,128 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:45,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 05:39:46,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ac68e518/0c943679f2554016b1923361552f0ba4/FLAGde521e157 [2025-02-08 05:39:46,568 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:46,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 05:39:46,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ac68e518/0c943679f2554016b1923361552f0ba4/FLAGde521e157 [2025-02-08 05:39:46,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ac68e518/0c943679f2554016b1923361552f0ba4 [2025-02-08 05:39:46,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:46,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:46,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:46,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:46,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:46,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4dffcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46, skipping insertion in model container [2025-02-08 05:39:46,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:46,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:46,769 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:46,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:46,807 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:46,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46 WrapperNode [2025-02-08 05:39:46,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:46,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:46,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:46,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:46,814 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:39:46" (1/1) ... [2025-02-08 05:39:46,826 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:39:46" (1/1) ... [2025-02-08 05:39:46,848 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 166 [2025-02-08 05:39:46,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:46,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:46,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:46,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:46,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:46,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:46,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:46,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:46,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (1/1) ... [2025-02-08 05:39:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:46,909 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:39:46,912 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:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:46,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:46,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:46,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:46,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:46,932 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:39:47,007 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:47,008 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~post3#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: #t~post3#1 := ~i~0#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: havoc ~tmp~0#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~ret2#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-1: havoc #t~mem1#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: ~tmp~0#1 := #t~ret2#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: #t~ret2#1 := plus_#res#1; [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: [2025-02-08 05:39:47,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: ~counter~0 := ~tmp~0#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: havoc #t~post6#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: #t~post6#1 := ~i~1#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-5: havoc ~tmp~1#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc #t~ret5#1; [2025-02-08 05:39:47,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~mem4#1; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: ~tmp~1#1 := #t~ret5#1; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-5: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-6: #t~ret5#1 := minus_#res#1; [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: [2025-02-08 05:39:47,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: ~counter~0 := ~tmp~1#1; [2025-02-08 05:39:47,255 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:47,256 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:47,264 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:47,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:47,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:47 BoogieIcfgContainer [2025-02-08 05:39:47,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:47,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:47,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:47,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:46" (1/3) ... [2025-02-08 05:39:47,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1973c249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:47, skipping insertion in model container [2025-02-08 05:39:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:46" (2/3) ... [2025-02-08 05:39:47,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1973c249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:47, skipping insertion in model container [2025-02-08 05:39:47,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:47" (3/3) ... [2025-02-08 05:39:47,271 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-02-08 05:39:47,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:47,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 187 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-02-08 05:39:47,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:47,378 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:39:47,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 196 transitions, 406 flow [2025-02-08 05:39:47,488 INFO L124 PetriNetUnfolderBase]: 10/194 cut-off events. [2025-02-08 05:39:47,491 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:47,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 194 events. 10/194 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 299 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2025-02-08 05:39:47,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 196 transitions, 406 flow [2025-02-08 05:39:47,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 177 transitions, 363 flow [2025-02-08 05:39:47,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:47,520 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;@64f48268, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:47,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:39:47,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:47,529 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-02-08 05:39:47,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:47,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:47,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:47,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:47,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2134955902, now seen corresponding path program 1 times [2025-02-08 05:39:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779168120] [2025-02-08 05:39:47,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:47,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 05:39:47,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 05:39:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:47,669 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:39:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779168120] [2025-02-08 05:39:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779168120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357601770] [2025-02-08 05:39:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:47,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:47,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:47,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 196 [2025-02-08 05:39:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:39:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 196 [2025-02-08 05:39:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:47,773 INFO L124 PetriNetUnfolderBase]: 4/248 cut-off events. [2025-02-08 05:39:47,773 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:39:47,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 248 events. 4/248 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 639 event pairs, 3 based on Foata normal form. 10/227 useless extension candidates. Maximal degree in co-relation 177. Up to 16 conditions per place. [2025-02-08 05:39:47,775 INFO L140 encePairwiseOnDemand]: 185/196 looper letters, 9 selfloop transitions, 2 changer transitions 2/168 dead transitions. [2025-02-08 05:39:47,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 168 transitions, 367 flow [2025-02-08 05:39:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-02-08 05:39:47,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2025-02-08 05:39:47,787 INFO L175 Difference]: Start difference. First operand has 175 places, 177 transitions, 363 flow. Second operand 3 states and 536 transitions. [2025-02-08 05:39:47,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 168 transitions, 367 flow [2025-02-08 05:39:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 168 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:39:47,795 INFO L231 Difference]: Finished difference. Result has 173 places, 166 transitions, 340 flow [2025-02-08 05:39:47,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=173, PETRI_TRANSITIONS=166} [2025-02-08 05:39:47,800 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -2 predicate places. [2025-02-08 05:39:47,800 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 166 transitions, 340 flow [2025-02-08 05:39:47,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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:39:47,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:47,801 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] [2025-02-08 05:39:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:47,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1151192764, now seen corresponding path program 1 times [2025-02-08 05:39:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140023211] [2025-02-08 05:39:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:39:47,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:39:47,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:47,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:47,851 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:39:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140023211] [2025-02-08 05:39:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140023211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:47,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915345725] [2025-02-08 05:39:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:47,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:47,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:47,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:47,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 196 [2025-02-08 05:39:47,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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:39:47,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 196 [2025-02-08 05:39:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:47,949 INFO L124 PetriNetUnfolderBase]: 9/354 cut-off events. [2025-02-08 05:39:47,949 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:47,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 354 events. 9/354 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1343 event pairs, 8 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 365. Up to 25 conditions per place. [2025-02-08 05:39:47,952 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 9 selfloop transitions, 1 changer transitions 0/163 dead transitions. [2025-02-08 05:39:47,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 354 flow [2025-02-08 05:39:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-02-08 05:39:47,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996598639455783 [2025-02-08 05:39:47,954 INFO L175 Difference]: Start difference. First operand has 173 places, 166 transitions, 340 flow. Second operand 3 states and 529 transitions. [2025-02-08 05:39:47,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 354 flow [2025-02-08 05:39:47,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 163 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:47,957 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 332 flow [2025-02-08 05:39:47,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-02-08 05:39:47,958 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -7 predicate places. [2025-02-08 05:39:47,958 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 332 flow [2025-02-08 05:39:47,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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:39:47,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:47,959 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:39:47,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:47,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -850260708, now seen corresponding path program 1 times [2025-02-08 05:39:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620083244] [2025-02-08 05:39:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:39:48,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:39:48,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:48,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:48,520 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:39:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620083244] [2025-02-08 05:39:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620083244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631798091] [2025-02-08 05:39:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:48,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:48,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:48,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 196 [2025-02-08 05:39:48,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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:39:48,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:48,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 196 [2025-02-08 05:39:48,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:48,740 INFO L124 PetriNetUnfolderBase]: 25/379 cut-off events. [2025-02-08 05:39:48,741 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:39:48,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 379 events. 25/379 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1520 event pairs, 24 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 440. Up to 68 conditions per place. [2025-02-08 05:39:48,745 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 19 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-02-08 05:39:48,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 162 transitions, 378 flow [2025-02-08 05:39:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 985 transitions. [2025-02-08 05:39:48,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8375850340136054 [2025-02-08 05:39:48,750 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 332 flow. Second operand 6 states and 985 transitions. [2025-02-08 05:39:48,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 162 transitions, 378 flow [2025-02-08 05:39:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 162 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:48,754 INFO L231 Difference]: Finished difference. Result has 171 places, 162 transitions, 339 flow [2025-02-08 05:39:48,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=171, PETRI_TRANSITIONS=162} [2025-02-08 05:39:48,757 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -4 predicate places. [2025-02-08 05:39:48,757 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 162 transitions, 339 flow [2025-02-08 05:39:48,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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:39:48,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:48,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:48,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:48,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:48,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1756372719, now seen corresponding path program 1 times [2025-02-08 05:39:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541551196] [2025-02-08 05:39:48,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:39:48,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:39:48,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:48,808 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:39:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541551196] [2025-02-08 05:39:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541551196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:48,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081919003] [2025-02-08 05:39:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:48,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:48,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:48,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 196 [2025-02-08 05:39:48,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 162 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:39:48,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:48,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 196 [2025-02-08 05:39:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:48,862 INFO L124 PetriNetUnfolderBase]: 4/225 cut-off events. [2025-02-08 05:39:48,863 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:39:48,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 225 events. 4/225 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 517 event pairs, 3 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 237. Up to 15 conditions per place. [2025-02-08 05:39:48,863 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 8 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-02-08 05:39:48,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 357 flow [2025-02-08 05:39:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2025-02-08 05:39:48,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013605442176871 [2025-02-08 05:39:48,867 INFO L175 Difference]: Start difference. First operand has 171 places, 162 transitions, 339 flow. Second operand 3 states and 530 transitions. [2025-02-08 05:39:48,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 357 flow [2025-02-08 05:39:48,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 161 transitions, 347 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:48,871 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 331 flow [2025-02-08 05:39:48,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2025-02-08 05:39:48,873 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -8 predicate places. [2025-02-08 05:39:48,874 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 331 flow [2025-02-08 05:39:48,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:39:48,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:48,874 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] [2025-02-08 05:39:48,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:48,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:48,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -564278154, now seen corresponding path program 1 times [2025-02-08 05:39:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014781136] [2025-02-08 05:39:48,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:48,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:39:48,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:39:48,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:48,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:48,916 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:39:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014781136] [2025-02-08 05:39:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014781136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793181780] [2025-02-08 05:39:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:48,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:48,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 196 [2025-02-08 05:39:48,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:39:48,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:48,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 196 [2025-02-08 05:39:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:48,954 INFO L124 PetriNetUnfolderBase]: 9/310 cut-off events. [2025-02-08 05:39:48,955 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:39:48,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 310 events. 9/310 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1063 event pairs, 2 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 321. Up to 20 conditions per place. [2025-02-08 05:39:48,955 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 10 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-02-08 05:39:48,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 362 flow [2025-02-08 05:39:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-02-08 05:39:48,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-08 05:39:48,957 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 331 flow. Second operand 3 states and 539 transitions. [2025-02-08 05:39:48,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 362 flow [2025-02-08 05:39:48,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:48,959 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 337 flow [2025-02-08 05:39:48,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-02-08 05:39:48,960 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -9 predicate places. [2025-02-08 05:39:48,960 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 337 flow [2025-02-08 05:39:48,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:39:48,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:48,961 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] [2025-02-08 05:39:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:48,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2136358393, now seen corresponding path program 1 times [2025-02-08 05:39:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126008875] [2025-02-08 05:39:48,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:48,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:39:49,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:39:49,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:49,114 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:39:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126008875] [2025-02-08 05:39:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126008875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:49,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:39:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763542688] [2025-02-08 05:39:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:39:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:49,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:39:49,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:39:49,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 196 [2025-02-08 05:39:49,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 337 flow. Second operand has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 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:39:49,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:49,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 196 [2025-02-08 05:39:49,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:49,331 INFO L124 PetriNetUnfolderBase]: 7/323 cut-off events. [2025-02-08 05:39:49,332 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:49,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 323 events. 7/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 932 event pairs, 4 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 362. Up to 15 conditions per place. [2025-02-08 05:39:49,333 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 14 selfloop transitions, 14 changer transitions 0/172 dead transitions. [2025-02-08 05:39:49,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 421 flow [2025-02-08 05:39:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:39:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:39:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1709 transitions. [2025-02-08 05:39:49,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871938775510204 [2025-02-08 05:39:49,336 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 337 flow. Second operand 10 states and 1709 transitions. [2025-02-08 05:39:49,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 421 flow [2025-02-08 05:39:49,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:49,339 INFO L231 Difference]: Finished difference. Result has 179 places, 168 transitions, 403 flow [2025-02-08 05:39:49,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=179, PETRI_TRANSITIONS=168} [2025-02-08 05:39:49,340 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 4 predicate places. [2025-02-08 05:39:49,340 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 168 transitions, 403 flow [2025-02-08 05:39:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 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:39:49,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:49,341 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] [2025-02-08 05:39:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:49,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash -214519636, now seen corresponding path program 1 times [2025-02-08 05:39:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724460224] [2025-02-08 05:39:49,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:49,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:39:49,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:39:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:49,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:49,529 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:39:49,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724460224] [2025-02-08 05:39:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724460224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:49,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:49,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:39:49,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136267972] [2025-02-08 05:39:49,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:49,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:39:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:49,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:39:49,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:39:49,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 196 [2025-02-08 05:39:49,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 168 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 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:39:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 196 [2025-02-08 05:39:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:49,773 INFO L124 PetriNetUnfolderBase]: 7/293 cut-off events. [2025-02-08 05:39:49,773 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2025-02-08 05:39:49,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 293 events. 7/293 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 777 event pairs, 4 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 343. Up to 15 conditions per place. [2025-02-08 05:39:49,774 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 10 selfloop transitions, 8 changer transitions 12/174 dead transitions. [2025-02-08 05:39:49,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 476 flow [2025-02-08 05:39:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:39:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:39:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1709 transitions. [2025-02-08 05:39:49,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871938775510204 [2025-02-08 05:39:49,777 INFO L175 Difference]: Start difference. First operand has 179 places, 168 transitions, 403 flow. Second operand 10 states and 1709 transitions. [2025-02-08 05:39:49,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 476 flow [2025-02-08 05:39:49,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 174 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:49,780 INFO L231 Difference]: Finished difference. Result has 189 places, 162 transitions, 391 flow [2025-02-08 05:39:49,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=391, PETRI_PLACES=189, PETRI_TRANSITIONS=162} [2025-02-08 05:39:49,781 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 14 predicate places. [2025-02-08 05:39:49,781 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 162 transitions, 391 flow [2025-02-08 05:39:49,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 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:39:49,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:49,782 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] [2025-02-08 05:39:49,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:49,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:49,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2101770300, now seen corresponding path program 1 times [2025-02-08 05:39:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049655277] [2025-02-08 05:39:49,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:49,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:39:49,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:39:49,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:49,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:39:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049655277] [2025-02-08 05:39:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049655277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351592986] [2025-02-08 05:39:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:50,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:50,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 196 [2025-02-08 05:39:50,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 162 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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:39:50,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:50,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 196 [2025-02-08 05:39:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:50,294 INFO L124 PetriNetUnfolderBase]: 9/245 cut-off events. [2025-02-08 05:39:50,294 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:39:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 245 events. 9/245 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 561 event pairs, 2 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 305. Up to 20 conditions per place. [2025-02-08 05:39:50,296 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 16 selfloop transitions, 4 changer transitions 4/165 dead transitions. [2025-02-08 05:39:50,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 165 transitions, 445 flow [2025-02-08 05:39:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1029 transitions. [2025-02-08 05:39:50,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-02-08 05:39:50,298 INFO L175 Difference]: Start difference. First operand has 189 places, 162 transitions, 391 flow. Second operand 6 states and 1029 transitions. [2025-02-08 05:39:50,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 165 transitions, 445 flow [2025-02-08 05:39:50,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 165 transitions, 401 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-02-08 05:39:50,301 INFO L231 Difference]: Finished difference. Result has 172 places, 157 transitions, 345 flow [2025-02-08 05:39:50,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=172, PETRI_TRANSITIONS=157} [2025-02-08 05:39:50,302 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2025-02-08 05:39:50,302 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 157 transitions, 345 flow [2025-02-08 05:39:50,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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:39:50,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:50,303 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:39:50,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:50,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:39:50,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1093342033, now seen corresponding path program 1 times [2025-02-08 05:39:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:50,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098773792] [2025-02-08 05:39:50,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:50,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:39:50,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:39:50,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:39:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098773792] [2025-02-08 05:39:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098773792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272650850] [2025-02-08 05:39:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:50,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:50,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 196 [2025-02-08 05:39:50,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 157 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 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:39:50,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:50,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 196 [2025-02-08 05:39:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:50,787 INFO L124 PetriNetUnfolderBase]: 8/234 cut-off events. [2025-02-08 05:39:50,787 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-08 05:39:50,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 234 events. 8/234 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 531 event pairs, 1 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 266. Up to 17 conditions per place. [2025-02-08 05:39:50,788 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 0 selfloop transitions, 0 changer transitions 160/160 dead transitions. [2025-02-08 05:39:50,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 160 transitions, 393 flow [2025-02-08 05:39:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1028 transitions. [2025-02-08 05:39:50,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741496598639455 [2025-02-08 05:39:50,790 INFO L175 Difference]: Start difference. First operand has 172 places, 157 transitions, 345 flow. Second operand 6 states and 1028 transitions. [2025-02-08 05:39:50,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 160 transitions, 393 flow [2025-02-08 05:39:50,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 160 transitions, 386 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:50,793 INFO L231 Difference]: Finished difference. Result has 168 places, 0 transitions, 0 flow [2025-02-08 05:39:50,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=168, PETRI_TRANSITIONS=0} [2025-02-08 05:39:50,794 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, -7 predicate places. [2025-02-08 05:39:50,794 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 0 transitions, 0 flow [2025-02-08 05:39:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 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:39:50,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:39:50,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:39:50,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:39:50,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:50,799 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:50,804 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:50,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:50,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:50 BasicIcfg [2025-02-08 05:39:50,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:50,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:50,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:50,811 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:50,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:47" (3/4) ... [2025-02-08 05:39:50,813 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:50,816 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:50,816 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:50,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 05:39:50,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:50,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:50,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:50,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:50,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:50,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:50,885 INFO L158 Benchmark]: Toolchain (without parser) took 4267.24ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.7MB in the beginning and 183.8MB in the end (delta: -59.1MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,885 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:50,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.79ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.59ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,885 INFO L158 Benchmark]: Boogie Preprocessor took 28.46ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 109.5MB in the end (delta: 742.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:50,885 INFO L158 Benchmark]: IcfgBuilder took 387.08ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 88.7MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,886 INFO L158 Benchmark]: TraceAbstraction took 3544.29ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 87.9MB in the beginning and 190.7MB in the end (delta: -102.8MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,886 INFO L158 Benchmark]: Witness Printer took 72.81ms. Allocated memory is still 352.3MB. Free memory was 190.7MB in the beginning and 183.8MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:50,887 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.23ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.79ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.59ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.46ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 109.5MB in the end (delta: 742.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 387.08ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 88.7MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3544.29ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 87.9MB in the beginning and 190.7MB in the end (delta: -102.8MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Witness Printer took 72.81ms. Allocated memory is still 352.3MB. Free memory was 190.7MB in the beginning and 183.8MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 89]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 271 locations, 18 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: 3.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 435 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 23 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 2/2 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:50,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE