./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/goblint-regression/09-regions_28-list2alloc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 318281cc312c05fd633ca0d066d65c4887939b5717e7fb2aba02dbd1a639e1ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:25:25,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:25:25,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:25:25,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:25:25,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:25:25,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:25:25,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:25:25,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:25:25,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:25:25,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:25:25,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:25:25,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:25:25,900 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:25:25,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:25:25,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:25:25,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:25:25,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:25:25,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:25:25,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:25,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:25,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:25:25,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:25:25,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:25:25,903 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 -> 318281cc312c05fd633ca0d066d65c4887939b5717e7fb2aba02dbd1a639e1ad [2025-01-09 21:25:26,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:25:26,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:25:26,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:25:26,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:25:26,118 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:25:26,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2025-01-09 21:25:27,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c52953e44/1eab01ce2b7c416994fdfbb910951c0e/FLAG93bf5d27b [2025-01-09 21:25:27,505 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:25:27,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2025-01-09 21:25:27,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c52953e44/1eab01ce2b7c416994fdfbb910951c0e/FLAG93bf5d27b [2025-01-09 21:25:27,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c52953e44/1eab01ce2b7c416994fdfbb910951c0e [2025-01-09 21:25:27,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:25:27,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:25:27,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:27,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:25:27,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:25:27,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:27" (1/1) ... [2025-01-09 21:25:27,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea601e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:27, skipping insertion in model container [2025-01-09 21:25:27,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:27" (1/1) ... [2025-01-09 21:25:27,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:25:28,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:28,139 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:25:28,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:28,239 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:25:28,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28 WrapperNode [2025-01-09 21:25:28,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:28,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:28,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:25:28,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:25:28,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,277 INFO L138 Inliner]: procedures = 368, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2025-01-09 21:25:28,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:28,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:25:28,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:25:28,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:25:28,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:25:28,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:25:28,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:25:28,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:25:28,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (1/1) ... [2025-01-09 21:25:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:28,329 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-01-09 21:25:28,331 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-01-09 21:25:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:25:28,347 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:25:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:25:28,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:25:28,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:25:28,349 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:25:28,459 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:25:28,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:25:28,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:25:28,742 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:25:28,756 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:25:28,757 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:25:28,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:28 BoogieIcfgContainer [2025-01-09 21:25:28,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:25:28,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:25:28,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:25:28,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:25:28,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:25:27" (1/3) ... [2025-01-09 21:25:28,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4272d53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:28, skipping insertion in model container [2025-01-09 21:25:28,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:28" (2/3) ... [2025-01-09 21:25:28,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4272d53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:28, skipping insertion in model container [2025-01-09 21:25:28,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:28" (3/3) ... [2025-01-09 21:25:28,763 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2025-01-09 21:25:28,773 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:25:28,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_28-list2alloc.i that has 2 procedures, 178 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2025-01-09 21:25:28,774 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:25:28,826 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:25:28,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 177 transitions, 358 flow [2025-01-09 21:25:28,916 INFO L124 PetriNetUnfolderBase]: 0/176 cut-off events. [2025-01-09 21:25:28,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 176 events. 0/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:25:28,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 177 transitions, 358 flow [2025-01-09 21:25:28,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 176 transitions, 355 flow [2025-01-09 21:25:28,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:25:28,963 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;@37165e44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:25:28,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:25:28,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:25:28,976 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:25:28,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:28,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:28,977 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] [2025-01-09 21:25:28,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:28,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1230530595, now seen corresponding path program 1 times [2025-01-09 21:25:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:28,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874417291] [2025-01-09 21:25:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:29,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:25:29,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:25:29,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:29,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874417291] [2025-01-09 21:25:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874417291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:29,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476610037] [2025-01-09 21:25:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:29,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:29,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:29,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2025-01-09 21:25:29,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 176 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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-01-09 21:25:29,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:29,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2025-01-09 21:25:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:30,136 INFO L124 PetriNetUnfolderBase]: 120/630 cut-off events. [2025-01-09 21:25:30,136 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:25:30,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 630 events. 120/630 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2697 event pairs, 120 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 801. Up to 278 conditions per place. [2025-01-09 21:25:30,143 INFO L140 encePairwiseOnDemand]: 165/177 looper letters, 37 selfloop transitions, 10 changer transitions 0/174 dead transitions. [2025-01-09 21:25:30,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 174 transitions, 445 flow [2025-01-09 21:25:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2025-01-09 21:25:30,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693032015065914 [2025-01-09 21:25:30,162 INFO L175 Difference]: Start difference. First operand has 180 places, 176 transitions, 355 flow. Second operand 6 states and 817 transitions. [2025-01-09 21:25:30,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 174 transitions, 445 flow [2025-01-09 21:25:30,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 174 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:30,171 INFO L231 Difference]: Finished difference. Result has 182 places, 174 transitions, 370 flow [2025-01-09 21:25:30,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=182, PETRI_TRANSITIONS=174} [2025-01-09 21:25:30,176 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2025-01-09 21:25:30,177 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 174 transitions, 370 flow [2025-01-09 21:25:30,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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-01-09 21:25:30,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:30,178 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] [2025-01-09 21:25:30,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:25:30,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:30,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1677527440, now seen corresponding path program 1 times [2025-01-09 21:25:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011334375] [2025-01-09 21:25:30,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:25:30,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:25:30,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:30,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011334375] [2025-01-09 21:25:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011334375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153094032] [2025-01-09 21:25:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:30,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:30,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:30,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2025-01-09 21:25:30,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 174 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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-01-09 21:25:30,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:30,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2025-01-09 21:25:30,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:30,816 INFO L124 PetriNetUnfolderBase]: 120/635 cut-off events. [2025-01-09 21:25:30,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:30,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 635 events. 120/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2765 event pairs, 120 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 842. Up to 278 conditions per place. [2025-01-09 21:25:30,819 INFO L140 encePairwiseOnDemand]: 165/177 looper letters, 37 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2025-01-09 21:25:30,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 172 transitions, 460 flow [2025-01-09 21:25:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2025-01-09 21:25:30,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693032015065914 [2025-01-09 21:25:30,821 INFO L175 Difference]: Start difference. First operand has 182 places, 174 transitions, 370 flow. Second operand 6 states and 817 transitions. [2025-01-09 21:25:30,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 172 transitions, 460 flow [2025-01-09 21:25:30,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 172 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:30,824 INFO L231 Difference]: Finished difference. Result has 180 places, 172 transitions, 366 flow [2025-01-09 21:25:30,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=180, PETRI_TRANSITIONS=172} [2025-01-09 21:25:30,824 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 0 predicate places. [2025-01-09 21:25:30,824 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 172 transitions, 366 flow [2025-01-09 21:25:30,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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-01-09 21:25:30,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:30,826 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] [2025-01-09 21:25:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:25:30,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:30,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1607055914, now seen corresponding path program 1 times [2025-01-09 21:25:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069217596] [2025-01-09 21:25:30,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:25:30,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:25:30,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:30,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:30,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069217596] [2025-01-09 21:25:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069217596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:30,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:25:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314763389] [2025-01-09 21:25:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:30,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:30,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:30,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 177 [2025-01-09 21:25:30,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 172 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-01-09 21:25:30,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:30,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 177 [2025-01-09 21:25:30,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:30,915 INFO L124 PetriNetUnfolderBase]: 20/407 cut-off events. [2025-01-09 21:25:30,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:30,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 407 events. 20/407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1266 event pairs, 20 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 382. Up to 54 conditions per place. [2025-01-09 21:25:30,917 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 13 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-01-09 21:25:30,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 171 transitions, 394 flow [2025-01-09 21:25:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2025-01-09 21:25:30,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9397363465160076 [2025-01-09 21:25:30,919 INFO L175 Difference]: Start difference. First operand has 180 places, 172 transitions, 366 flow. Second operand 3 states and 499 transitions. [2025-01-09 21:25:30,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 171 transitions, 394 flow [2025-01-09 21:25:30,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:30,921 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 348 flow [2025-01-09 21:25:30,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2025-01-09 21:25:30,925 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -4 predicate places. [2025-01-09 21:25:30,926 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 348 flow [2025-01-09 21:25:30,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-01-09 21:25:30,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:30,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:30,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:25:30,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:30,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -438055570, now seen corresponding path program 1 times [2025-01-09 21:25:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163554792] [2025-01-09 21:25:30,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:25:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:25:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163554792] [2025-01-09 21:25:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163554792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:25:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875513484] [2025-01-09 21:25:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:30,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:30,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:30,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 177 [2025-01-09 21:25:30,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-01-09 21:25:30,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:30,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 177 [2025-01-09 21:25:30,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:31,031 INFO L124 PetriNetUnfolderBase]: 15/347 cut-off events. [2025-01-09 21:25:31,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:31,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 347 events. 15/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 910 event pairs, 15 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 338. Up to 43 conditions per place. [2025-01-09 21:25:31,032 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-01-09 21:25:31,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 170 transitions, 374 flow [2025-01-09 21:25:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2025-01-09 21:25:31,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943502824858757 [2025-01-09 21:25:31,034 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 348 flow. Second operand 3 states and 501 transitions. [2025-01-09 21:25:31,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 170 transitions, 374 flow [2025-01-09 21:25:31,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 170 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:25:31,036 INFO L231 Difference]: Finished difference. Result has 175 places, 170 transitions, 346 flow [2025-01-09 21:25:31,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=175, PETRI_TRANSITIONS=170} [2025-01-09 21:25:31,038 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -5 predicate places. [2025-01-09 21:25:31,038 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 346 flow [2025-01-09 21:25:31,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-01-09 21:25:31,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:31,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:31,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:25:31,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:31,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 5804600, now seen corresponding path program 1 times [2025-01-09 21:25:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664069893] [2025-01-09 21:25:31,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:31,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:25:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:25:31,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664069893] [2025-01-09 21:25:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664069893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:25:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475248034] [2025-01-09 21:25:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:31,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:31,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:31,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:31,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 177 [2025-01-09 21:25:31,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-01-09 21:25:31,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:31,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 177 [2025-01-09 21:25:31,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:31,183 INFO L124 PetriNetUnfolderBase]: 24/353 cut-off events. [2025-01-09 21:25:31,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:31,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 353 events. 24/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 920 event pairs, 13 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2025-01-09 21:25:31,185 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 14 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-01-09 21:25:31,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 382 flow [2025-01-09 21:25:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-01-09 21:25:31,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-01-09 21:25:31,186 INFO L175 Difference]: Start difference. First operand has 175 places, 170 transitions, 346 flow. Second operand 3 states and 507 transitions. [2025-01-09 21:25:31,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 382 flow [2025-01-09 21:25:31,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 172 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:25:31,192 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 352 flow [2025-01-09 21:25:31,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2025-01-09 21:25:31,193 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -6 predicate places. [2025-01-09 21:25:31,193 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 352 flow [2025-01-09 21:25:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-01-09 21:25:31,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:31,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:31,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:25:31,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 471380028, now seen corresponding path program 1 times [2025-01-09 21:25:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:31,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365788152] [2025-01-09 21:25:31,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:31,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:31,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:25:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:25:31,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365788152] [2025-01-09 21:25:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365788152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630918298] [2025-01-09 21:25:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:31,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:31,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 177 [2025-01-09 21:25:31,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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-01-09 21:25:31,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:31,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 177 [2025-01-09 21:25:31,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:31,946 INFO L124 PetriNetUnfolderBase]: 129/688 cut-off events. [2025-01-09 21:25:31,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:31,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 688 events. 129/688 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3153 event pairs, 78 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 894. Up to 258 conditions per place. [2025-01-09 21:25:31,949 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 51 selfloop transitions, 22 changer transitions 0/199 dead transitions. [2025-01-09 21:25:31,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 556 flow [2025-01-09 21:25:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2025-01-09 21:25:31,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210922787193974 [2025-01-09 21:25:31,950 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 352 flow. Second operand 6 states and 872 transitions. [2025-01-09 21:25:31,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 556 flow [2025-01-09 21:25:31,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 199 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:31,953 INFO L231 Difference]: Finished difference. Result has 184 places, 191 transitions, 502 flow [2025-01-09 21:25:31,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=184, PETRI_TRANSITIONS=191} [2025-01-09 21:25:31,954 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2025-01-09 21:25:31,954 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 191 transitions, 502 flow [2025-01-09 21:25:31,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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-01-09 21:25:31,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:31,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:31,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:25:31,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:31,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2145989061, now seen corresponding path program 1 times [2025-01-09 21:25:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558738818] [2025-01-09 21:25:31,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:31,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:25:31,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:25:31,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:31,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558738818] [2025-01-09 21:25:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558738818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437217890] [2025-01-09 21:25:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:32,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:32,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:32,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 177 [2025-01-09 21:25:32,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 191 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-01-09 21:25:32,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:32,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 177 [2025-01-09 21:25:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:32,663 INFO L124 PetriNetUnfolderBase]: 394/1373 cut-off events. [2025-01-09 21:25:32,664 INFO L125 PetriNetUnfolderBase]: For 266/280 co-relation queries the response was YES. [2025-01-09 21:25:32,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1373 events. 394/1373 cut-off events. For 266/280 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7590 event pairs, 142 based on Foata normal form. 4/1286 useless extension candidates. Maximal degree in co-relation 2556. Up to 686 conditions per place. [2025-01-09 21:25:32,671 INFO L140 encePairwiseOnDemand]: 154/177 looper letters, 78 selfloop transitions, 84 changer transitions 4/286 dead transitions. [2025-01-09 21:25:32,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 286 transitions, 1118 flow [2025-01-09 21:25:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2025-01-09 21:25:32,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8408662900188324 [2025-01-09 21:25:32,673 INFO L175 Difference]: Start difference. First operand has 184 places, 191 transitions, 502 flow. Second operand 6 states and 893 transitions. [2025-01-09 21:25:32,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 286 transitions, 1118 flow [2025-01-09 21:25:32,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 286 transitions, 1118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:32,678 INFO L231 Difference]: Finished difference. Result has 194 places, 270 transitions, 1148 flow [2025-01-09 21:25:32,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=194, PETRI_TRANSITIONS=270} [2025-01-09 21:25:32,679 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 14 predicate places. [2025-01-09 21:25:32,679 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 270 transitions, 1148 flow [2025-01-09 21:25:32,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-01-09 21:25:32,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:32,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:25:32,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:32,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2142416959, now seen corresponding path program 1 times [2025-01-09 21:25:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017945186] [2025-01-09 21:25:32,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:32,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:25:32,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:25:32,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:32,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017945186] [2025-01-09 21:25:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017945186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:32,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:32,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683794119] [2025-01-09 21:25:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:32,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:33,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 177 [2025-01-09 21:25:33,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 270 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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-01-09 21:25:33,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:33,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 177 [2025-01-09 21:25:33,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:33,306 INFO L124 PetriNetUnfolderBase]: 344/1224 cut-off events. [2025-01-09 21:25:33,306 INFO L125 PetriNetUnfolderBase]: For 754/766 co-relation queries the response was YES. [2025-01-09 21:25:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1224 events. 344/1224 cut-off events. For 754/766 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6668 event pairs, 77 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 3113. Up to 606 conditions per place. [2025-01-09 21:25:33,313 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 146 selfloop transitions, 37 changer transitions 0/305 dead transitions. [2025-01-09 21:25:33,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 305 transitions, 1692 flow [2025-01-09 21:25:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2025-01-09 21:25:33,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928436911487758 [2025-01-09 21:25:33,315 INFO L175 Difference]: Start difference. First operand has 194 places, 270 transitions, 1148 flow. Second operand 6 states and 842 transitions. [2025-01-09 21:25:33,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 305 transitions, 1692 flow [2025-01-09 21:25:33,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 305 transitions, 1674 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:33,325 INFO L231 Difference]: Finished difference. Result has 204 places, 297 transitions, 1472 flow [2025-01-09 21:25:33,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=204, PETRI_TRANSITIONS=297} [2025-01-09 21:25:33,325 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 24 predicate places. [2025-01-09 21:25:33,326 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 297 transitions, 1472 flow [2025-01-09 21:25:33,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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-01-09 21:25:33,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:33,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:25:33,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 626842857, now seen corresponding path program 1 times [2025-01-09 21:25:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468143927] [2025-01-09 21:25:33,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:33,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:25:33,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:25:33,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:33,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468143927] [2025-01-09 21:25:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468143927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:25:33,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773094692] [2025-01-09 21:25:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:33,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:33,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:33,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:33,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:33,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 177 [2025-01-09 21:25:33,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 297 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-01-09 21:25:33,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:33,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 177 [2025-01-09 21:25:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:33,535 INFO L124 PetriNetUnfolderBase]: 257/1033 cut-off events. [2025-01-09 21:25:33,535 INFO L125 PetriNetUnfolderBase]: For 847/857 co-relation queries the response was YES. [2025-01-09 21:25:33,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1033 events. 257/1033 cut-off events. For 847/857 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5324 event pairs, 18 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 2523. Up to 251 conditions per place. [2025-01-09 21:25:33,541 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 6 selfloop transitions, 5 changer transitions 0/300 dead transitions. [2025-01-09 21:25:33,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 300 transitions, 1500 flow [2025-01-09 21:25:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-01-09 21:25:33,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792843691148776 [2025-01-09 21:25:33,542 INFO L175 Difference]: Start difference. First operand has 204 places, 297 transitions, 1472 flow. Second operand 3 states and 520 transitions. [2025-01-09 21:25:33,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 300 transitions, 1500 flow [2025-01-09 21:25:33,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 300 transitions, 1444 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-01-09 21:25:33,552 INFO L231 Difference]: Finished difference. Result has 207 places, 299 transitions, 1439 flow [2025-01-09 21:25:33,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=207, PETRI_TRANSITIONS=299} [2025-01-09 21:25:33,553 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 27 predicate places. [2025-01-09 21:25:33,553 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 299 transitions, 1439 flow [2025-01-09 21:25:33,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-01-09 21:25:33,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:33,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:25:33,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:33,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash -104082715, now seen corresponding path program 2 times [2025-01-09 21:25:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:33,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42011787] [2025-01-09 21:25:33,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:33,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:25:33,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:25:33,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:33,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:25:33,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:25:33,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:25:33,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:25:33,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:33,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:25:33,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:25:33,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:25:33,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:25:33,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:25:33,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:25:33,634 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:33,702 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:25:33,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:25:33,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:25:33 BasicIcfg [2025-01-09 21:25:33,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:25:33,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:25:33,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:25:33,709 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:25:33,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:28" (3/4) ... [2025-01-09 21:25:33,710 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:25:33,759 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 5. [2025-01-09 21:25:33,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:25:33,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:25:33,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:25:33,794 INFO L158 Benchmark]: Toolchain (without parser) took 5989.86ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.2MB in the beginning and 241.0MB in the end (delta: -118.9MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-01-09 21:25:33,794 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:25:33,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.43ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 83.5MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:25:33,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.99ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:25:33,795 INFO L158 Benchmark]: Boogie Preprocessor took 21.91ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 79.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:25:33,796 INFO L158 Benchmark]: RCFGBuilder took 455.48ms. Allocated memory is still 167.8MB. Free memory was 79.0MB in the beginning and 54.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:25:33,796 INFO L158 Benchmark]: TraceAbstraction took 4949.95ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 54.9MB in the beginning and 257.8MB in the end (delta: -202.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-01-09 21:25:33,796 INFO L158 Benchmark]: Witness Printer took 83.44ms. Allocated memory is still 377.5MB. Free memory was 257.8MB in the beginning and 241.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:25:33,798 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.46ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.43ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 83.5MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.99ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.91ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 79.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 455.48ms. Allocated memory is still 167.8MB. Free memory was 79.0MB in the beginning and 54.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4949.95ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 54.9MB in the beginning and 257.8MB in the end (delta: -202.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 83.44ms. Allocated memory is still 377.5MB. Free memory was 257.8MB in the beginning and 241.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1237]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1233] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1234] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1245] 0 pthread_t t1; [L1246] CALL, EXPR 0 new(3) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1229] 0 p->datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1230] 0 p->next = ((void *)0) VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1231] 0 return p; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, \result={-2:0}, p={-2:0}, x=3] [L1246] RET, EXPR 0 new(3) [L1246] 0 A = new(3) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1247] CALL, EXPR 0 new(5) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1229] 0 p->datum = x VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1230] 0 p->next = ((void *)0) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1231] 0 return p; VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, \result={-3:0}, p={-3:0}, x=5] [L1247] RET, EXPR 0 new(5) [L1247] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}] [L1248] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1249] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, t1=-1] [L1251] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1237] EXPR 1 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1253] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1237] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: B = new(5) [1247] * C: p->datum = x [1229] * C: *data = 42 [1253] * C: p->next = ((void *)0) [1230] * C: p->next = ((void *)0) [1230] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: A = new(3) [1246] and C: A->datum++ [1237] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 235 locations, 21 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: 4.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1684 IncrementalHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 10 mSDtfsCounter, 1684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1472occurred in iteration=8, InterpolantAutomatonStates: 42, 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.9s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:25:33,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)